./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.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_112721ab-b921-434f-974a-88f97023d10f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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 dd713315a01a83d82c28c42f2ad6c72c3349a374 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:07:13,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:07:13,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:07:13,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:07:13,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:07:13,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:07:13,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:07:13,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:07:13,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:07:13,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:07:13,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:07:13,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:07:13,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:07:13,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:07:13,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:07:13,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:07:13,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:07:13,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:07:13,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:07:13,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:07:13,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:07:13,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:07:13,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:07:13,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:07:13,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:07:13,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:07:13,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:07:13,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:07:13,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:07:13,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:07:13,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:07:13,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:07:13,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:07:13,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:07:13,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:07:13,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:07:13,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:07:13,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:07:13,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:07:13,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:07:13,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:07:13,418 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:07:13,434 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:07:13,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:07:13,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:07:13,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:07:13,436 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:07:13,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:07:13,437 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:07:13,437 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:07:13,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:07:13,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:07:13,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:07:13,438 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:07:13,438 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:07:13,439 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:07:13,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:07:13,439 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:07:13,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:07:13,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:07:13,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:07:13,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:07:13,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:07:13,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:07:13,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:07:13,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:07:13,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:07:13,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:07:13,443 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_112721ab-b921-434f-974a-88f97023d10f/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 -> dd713315a01a83d82c28c42f2ad6c72c3349a374 [2019-11-16 00:07:13,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:07:13,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:07:13,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:07:13,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:07:13,492 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:07:13,493 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2019-11-16 00:07:13,563 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/bin/uautomizer/data/10bb175bc/1c7958e5e977425f975fe46e0fbd7f52/FLAG01ac80016 [2019-11-16 00:07:14,017 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:07:14,026 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2019-11-16 00:07:14,046 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/bin/uautomizer/data/10bb175bc/1c7958e5e977425f975fe46e0fbd7f52/FLAG01ac80016 [2019-11-16 00:07:14,310 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/bin/uautomizer/data/10bb175bc/1c7958e5e977425f975fe46e0fbd7f52 [2019-11-16 00:07:14,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:07:14,315 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:07:14,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:07:14,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:07:14,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:07:14,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:07:14" (1/1) ... [2019-11-16 00:07:14,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a989019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:14, skipping insertion in model container [2019-11-16 00:07:14,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:07:14" (1/1) ... [2019-11-16 00:07:14,331 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:07:14,386 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:07:14,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:07:14,931 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:07:14,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:07:15,035 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:07:15,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:15 WrapperNode [2019-11-16 00:07:15,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:07:15,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:07:15,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:07:15,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:07:15,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:15" (1/1) ... [2019-11-16 00:07:15,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:15" (1/1) ... [2019-11-16 00:07:15,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:15" (1/1) ... [2019-11-16 00:07:15,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:15" (1/1) ... [2019-11-16 00:07:15,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:15" (1/1) ... [2019-11-16 00:07:15,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:15" (1/1) ... [2019-11-16 00:07:15,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:15" (1/1) ... [2019-11-16 00:07:15,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:07:15,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:07:15,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:07:15,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:07:15,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:07:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:07:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:07:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:07:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-16 00:07:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-16 00:07:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-16 00:07:15,178 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2019-11-16 00:07:15,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:07:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:07:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:07:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:07:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:07:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:07:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:07:15,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:07:15,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:07:15,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:07:15,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:07:15,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:07:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:07:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:07:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:07:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:07:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:07:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:07:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:07:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-16 00:07:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-16 00:07:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-16 00:07:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:07:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:07:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:07:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:07:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:07:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:07:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:07:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:07:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:07:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:07:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:07:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:07:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:07:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:07:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:07:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:07:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:07:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:07:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:07:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:07:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:07:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:07:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:07:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:07:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:07:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:07:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:07:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:07:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:07:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:07:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:07:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:07:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:07:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:07:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:07:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:07:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:07:15,191 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:07:15,191 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:07:15,191 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:07:15,191 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:07:15,191 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:07:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:07:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:07:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:07:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:07:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:07:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:07:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:07:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:07:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:07:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:07:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:07:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:07:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:07:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:07:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:07:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:07:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:07:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:07:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:07:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:07:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:07:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:07:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:07:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:07:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:07:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:07:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:07:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:07:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:07:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:07:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:07:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:07:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:07:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:07:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:07:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:07:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:07:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:07:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:07:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:07:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:07:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:07:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:07:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:07:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:07:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-16 00:07:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2019-11-16 00:07:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:07:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:07:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:07:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:07:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:07:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:07:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:07:15,957 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:07:15,957 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-16 00:07:15,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:07:15 BoogieIcfgContainer [2019-11-16 00:07:15,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:07:15,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:07:15,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:07:15,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:07:15,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:07:14" (1/3) ... [2019-11-16 00:07:15,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4ec21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:07:15, skipping insertion in model container [2019-11-16 00:07:15,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:15" (2/3) ... [2019-11-16 00:07:15,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4ec21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:07:15, skipping insertion in model container [2019-11-16 00:07:15,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:07:15" (3/3) ... [2019-11-16 00:07:15,967 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca-1.i [2019-11-16 00:07:15,978 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:07:15,987 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-16 00:07:16,000 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-16 00:07:16,021 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:07:16,022 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:07:16,022 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:07:16,022 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:07:16,022 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:07:16,023 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:07:16,023 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:07:16,023 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:07:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-16 00:07:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:07:16,053 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:16,054 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:16,056 INFO L410 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:16,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1274980559, now seen corresponding path program 1 times [2019-11-16 00:07:16,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:16,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623761835] [2019-11-16 00:07:16,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:16,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:16,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:16,336 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-16 00:07:16,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623761835] [2019-11-16 00:07:16,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:16,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:07:16,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948330049] [2019-11-16 00:07:16,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:07:16,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:16,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:07:16,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:07:16,362 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2019-11-16 00:07:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:16,684 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-11-16 00:07:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:07:16,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-16 00:07:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:16,708 INFO L225 Difference]: With dead ends: 83 [2019-11-16 00:07:16,708 INFO L226 Difference]: Without dead ends: 79 [2019-11-16 00:07:16,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-16 00:07:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2019-11-16 00:07:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-16 00:07:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-11-16 00:07:16,777 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 11 [2019-11-16 00:07:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:16,777 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-11-16 00:07:16,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:07:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-11-16 00:07:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:07:16,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:16,779 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:16,779 INFO L410 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:16,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:16,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1276827601, now seen corresponding path program 1 times [2019-11-16 00:07:16,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:16,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432930249] [2019-11-16 00:07:16,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:16,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:16,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:16,933 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-16 00:07:16,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432930249] [2019-11-16 00:07:16,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:16,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:16,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925818664] [2019-11-16 00:07:16,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:07:16,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:16,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:07:16,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:07:16,937 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 5 states. [2019-11-16 00:07:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:17,258 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-11-16 00:07:17,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:07:17,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-16 00:07:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:17,261 INFO L225 Difference]: With dead ends: 84 [2019-11-16 00:07:17,261 INFO L226 Difference]: Without dead ends: 84 [2019-11-16 00:07:17,262 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-16 00:07:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-16 00:07:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2019-11-16 00:07:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-16 00:07:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-16 00:07:17,273 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 11 [2019-11-16 00:07:17,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:17,274 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-16 00:07:17,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:07:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-11-16 00:07:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-16 00:07:17,275 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:17,275 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:17,275 INFO L410 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:17,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:17,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1276827600, now seen corresponding path program 1 times [2019-11-16 00:07:17,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:17,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605520008] [2019-11-16 00:07:17,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:17,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:17,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:17,337 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-16 00:07:17,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605520008] [2019-11-16 00:07:17,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:17,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:07:17,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988100902] [2019-11-16 00:07:17,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:17,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:17,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:17,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:17,340 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 4 states. [2019-11-16 00:07:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:17,501 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-11-16 00:07:17,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:17,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-16 00:07:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:17,503 INFO L225 Difference]: With dead ends: 62 [2019-11-16 00:07:17,503 INFO L226 Difference]: Without dead ends: 62 [2019-11-16 00:07:17,504 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-16 00:07:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-16 00:07:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-16 00:07:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-16 00:07:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2019-11-16 00:07:17,512 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 11 [2019-11-16 00:07:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:17,512 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2019-11-16 00:07:17,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2019-11-16 00:07:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:07:17,513 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:17,513 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:17,514 INFO L410 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:17,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:17,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1190586438, now seen corresponding path program 1 times [2019-11-16 00:07:17,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:17,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251788123] [2019-11-16 00:07:17,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:17,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:17,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:17,634 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-16 00:07:17,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251788123] [2019-11-16 00:07:17,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:17,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:17,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819290948] [2019-11-16 00:07:17,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:07:17,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:17,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:07:17,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:07:17,643 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 5 states. [2019-11-16 00:07:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:17,852 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-11-16 00:07:17,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:07:17,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-16 00:07:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:17,854 INFO L225 Difference]: With dead ends: 61 [2019-11-16 00:07:17,854 INFO L226 Difference]: Without dead ends: 61 [2019-11-16 00:07:17,855 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-16 00:07:17,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-16 00:07:17,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-16 00:07:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-16 00:07:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-11-16 00:07:17,862 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 13 [2019-11-16 00:07:17,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:17,863 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-11-16 00:07:17,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:07:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-11-16 00:07:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:07:17,864 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:17,865 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:17,865 INFO L410 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:17,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1190586490, now seen corresponding path program 1 times [2019-11-16 00:07:17,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:17,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894092200] [2019-11-16 00:07:17,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:17,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:17,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:17,935 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-16 00:07:17,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894092200] [2019-11-16 00:07:17,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:17,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:07:17,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547204317] [2019-11-16 00:07:17,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:17,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:17,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:17,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:17,938 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 4 states. [2019-11-16 00:07:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:18,105 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-11-16 00:07:18,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:18,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-16 00:07:18,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:18,107 INFO L225 Difference]: With dead ends: 59 [2019-11-16 00:07:18,107 INFO L226 Difference]: Without dead ends: 59 [2019-11-16 00:07:18,107 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-16 00:07:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-16 00:07:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-16 00:07:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-16 00:07:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-11-16 00:07:18,116 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 13 [2019-11-16 00:07:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:18,117 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-11-16 00:07:18,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-11-16 00:07:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:07:18,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:18,118 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:18,119 INFO L410 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:18,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:18,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1190586491, now seen corresponding path program 1 times [2019-11-16 00:07:18,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:18,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925125572] [2019-11-16 00:07:18,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:18,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:18,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:18,209 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-16 00:07:18,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925125572] [2019-11-16 00:07:18,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:18,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:07:18,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329705284] [2019-11-16 00:07:18,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:07:18,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:18,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:07:18,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:07:18,211 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 5 states. [2019-11-16 00:07:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:18,380 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2019-11-16 00:07:18,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:07:18,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-16 00:07:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:18,382 INFO L225 Difference]: With dead ends: 78 [2019-11-16 00:07:18,382 INFO L226 Difference]: Without dead ends: 78 [2019-11-16 00:07:18,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:07:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-16 00:07:18,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2019-11-16 00:07:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-16 00:07:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-11-16 00:07:18,394 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 13 [2019-11-16 00:07:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:18,395 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-11-16 00:07:18,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:07:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-11-16 00:07:18,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:07:18,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:18,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:18,420 INFO L410 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:18,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1247844793, now seen corresponding path program 1 times [2019-11-16 00:07:18,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:18,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167383032] [2019-11-16 00:07:18,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:18,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:18,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:18,566 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-16 00:07:18,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167383032] [2019-11-16 00:07:18,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:18,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:07:18,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947946461] [2019-11-16 00:07:18,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:07:18,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:18,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:07:18,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:07:18,568 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 6 states. [2019-11-16 00:07:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:18,800 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2019-11-16 00:07:18,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:07:18,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-16 00:07:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:18,802 INFO L225 Difference]: With dead ends: 81 [2019-11-16 00:07:18,802 INFO L226 Difference]: Without dead ends: 81 [2019-11-16 00:07:18,803 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-16 00:07:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-16 00:07:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-11-16 00:07:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-16 00:07:18,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2019-11-16 00:07:18,810 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 13 [2019-11-16 00:07:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:18,810 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-11-16 00:07:18,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:07:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2019-11-16 00:07:18,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:07:18,811 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:18,811 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:18,812 INFO L410 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:18,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:18,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1746526086, now seen corresponding path program 1 times [2019-11-16 00:07:18,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:18,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751120337] [2019-11-16 00:07:18,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:18,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:18,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:18,894 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-16 00:07:18,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751120337] [2019-11-16 00:07:18,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:18,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:18,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883127646] [2019-11-16 00:07:18,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:07:18,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:07:18,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:07:18,896 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 5 states. [2019-11-16 00:07:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:19,047 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2019-11-16 00:07:19,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:07:19,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-16 00:07:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:19,049 INFO L225 Difference]: With dead ends: 71 [2019-11-16 00:07:19,049 INFO L226 Difference]: Without dead ends: 71 [2019-11-16 00:07:19,049 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-16 00:07:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-16 00:07:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-16 00:07:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-16 00:07:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-11-16 00:07:19,056 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 14 [2019-11-16 00:07:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:19,056 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-11-16 00:07:19,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:07:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-11-16 00:07:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:07:19,061 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:19,061 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:19,062 INFO L410 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:19,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:19,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1874075756, now seen corresponding path program 1 times [2019-11-16 00:07:19,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:19,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747051907] [2019-11-16 00:07:19,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:19,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:19,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:19,223 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-16 00:07:19,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747051907] [2019-11-16 00:07:19,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175607842] [2019-11-16 00:07:19,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:19,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-16 00:07:19,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:19,426 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-11-16 00:07:19,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:07:19,457 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-16 00:07:19,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:19,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:19,491 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-16 00:07:19,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:19,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:19,503 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-16 00:07:19,503 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-16 00:07:19,528 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-16 00:07:19,529 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:19,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-16 00:07:19,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362819456] [2019-11-16 00:07:19,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:07:19,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:19,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:07:19,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:19,531 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 7 states. [2019-11-16 00:07:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:19,824 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2019-11-16 00:07:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:07:19,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-16 00:07:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:19,826 INFO L225 Difference]: With dead ends: 90 [2019-11-16 00:07:19,826 INFO L226 Difference]: Without dead ends: 90 [2019-11-16 00:07:19,826 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-16 00:07:19,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-16 00:07:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-11-16 00:07:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-16 00:07:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-11-16 00:07:19,832 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 15 [2019-11-16 00:07:19,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:19,833 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-11-16 00:07:19,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:07:19,833 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-11-16 00:07:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:07:19,840 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:19,841 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:20,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:20,042 INFO L410 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:20,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:20,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1524736785, now seen corresponding path program 1 times [2019-11-16 00:07:20,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:20,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450183876] [2019-11-16 00:07:20,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:20,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:20,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:20,117 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-16 00:07:20,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450183876] [2019-11-16 00:07:20,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:20,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:07:20,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344758813] [2019-11-16 00:07:20,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:07:20,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:20,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:07:20,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:07:20,119 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 6 states. [2019-11-16 00:07:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:20,284 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-11-16 00:07:20,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:07:20,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-16 00:07:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:20,286 INFO L225 Difference]: With dead ends: 64 [2019-11-16 00:07:20,286 INFO L226 Difference]: Without dead ends: 64 [2019-11-16 00:07:20,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-16 00:07:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-16 00:07:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-16 00:07:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-16 00:07:20,290 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 17 [2019-11-16 00:07:20,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:20,290 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-16 00:07:20,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:07:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-11-16 00:07:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:07:20,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:20,291 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:20,292 INFO L410 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1524736784, now seen corresponding path program 1 times [2019-11-16 00:07:20,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:20,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682703112] [2019-11-16 00:07:20,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:20,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:20,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:20,391 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-16 00:07:20,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682703112] [2019-11-16 00:07:20,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:20,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:07:20,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857102423] [2019-11-16 00:07:20,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:07:20,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:20,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:07:20,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:20,393 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 8 states. [2019-11-16 00:07:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:20,706 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2019-11-16 00:07:20,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:07:20,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-16 00:07:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:20,709 INFO L225 Difference]: With dead ends: 86 [2019-11-16 00:07:20,709 INFO L226 Difference]: Without dead ends: 86 [2019-11-16 00:07:20,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:07:20,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-16 00:07:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-11-16 00:07:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-16 00:07:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2019-11-16 00:07:20,715 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 17 [2019-11-16 00:07:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:20,715 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2019-11-16 00:07:20,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:07:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2019-11-16 00:07:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:07:20,716 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:20,717 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:20,717 INFO L410 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:20,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1869159940, now seen corresponding path program 1 times [2019-11-16 00:07:20,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:20,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617137358] [2019-11-16 00:07:20,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:20,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:20,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:20,857 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-16 00:07:20,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617137358] [2019-11-16 00:07:20,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530312911] [2019-11-16 00:07:20,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:20,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:07:20,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:21,029 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:21,029 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-16 00:07:21,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:21,064 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:07:21,065 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-16 00:07:21,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:07:21,087 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-16 00:07:21,087 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:21,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-16 00:07:21,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647693120] [2019-11-16 00:07:21,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:07:21,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:21,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:07:21,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:21,089 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2019-11-16 00:07:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:21,283 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-11-16 00:07:21,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:07:21,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-16 00:07:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:21,285 INFO L225 Difference]: With dead ends: 74 [2019-11-16 00:07:21,285 INFO L226 Difference]: Without dead ends: 74 [2019-11-16 00:07:21,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 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-16 00:07:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-16 00:07:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2019-11-16 00:07:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-16 00:07:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-16 00:07:21,290 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 17 [2019-11-16 00:07:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:21,290 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-16 00:07:21,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:07:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-11-16 00:07:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:07:21,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:21,291 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-16 00:07:21,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:21,495 INFO L410 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash 63888821, now seen corresponding path program 1 times [2019-11-16 00:07:21,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:21,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082622259] [2019-11-16 00:07:21,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:21,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:21,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:21,581 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-16 00:07:21,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082622259] [2019-11-16 00:07:21,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:21,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:07:21,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935019514] [2019-11-16 00:07:21,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:07:21,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:21,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:07:21,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:07:21,583 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 7 states. [2019-11-16 00:07:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:21,813 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-11-16 00:07:21,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:07:21,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-16 00:07:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:21,815 INFO L225 Difference]: With dead ends: 64 [2019-11-16 00:07:21,815 INFO L226 Difference]: Without dead ends: 64 [2019-11-16 00:07:21,816 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-16 00:07:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-16 00:07:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-11-16 00:07:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-16 00:07:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-11-16 00:07:21,819 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 21 [2019-11-16 00:07:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:21,820 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-11-16 00:07:21,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:07:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-11-16 00:07:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-16 00:07:21,821 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:21,821 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-16 00:07:21,821 INFO L410 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:21,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:21,822 INFO L82 PathProgramCache]: Analyzing trace with hash 63888822, now seen corresponding path program 1 times [2019-11-16 00:07:21,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:21,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181567590] [2019-11-16 00:07:21,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:21,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:21,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:21,932 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-16 00:07:21,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181567590] [2019-11-16 00:07:21,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:21,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:07:21,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657835376] [2019-11-16 00:07:21,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:07:21,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:21,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:07:21,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:07:21,934 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 9 states. [2019-11-16 00:07:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:22,280 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2019-11-16 00:07:22,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:07:22,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-16 00:07:22,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:22,282 INFO L225 Difference]: With dead ends: 76 [2019-11-16 00:07:22,282 INFO L226 Difference]: Without dead ends: 76 [2019-11-16 00:07:22,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:07:22,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-16 00:07:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2019-11-16 00:07:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-16 00:07:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-11-16 00:07:22,286 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 21 [2019-11-16 00:07:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:22,287 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-11-16 00:07:22,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:07:22,287 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-11-16 00:07:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:07:22,288 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:22,288 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] [2019-11-16 00:07:22,288 INFO L410 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:22,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1250379430, now seen corresponding path program 1 times [2019-11-16 00:07:22,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:22,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840254861] [2019-11-16 00:07:22,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:22,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:22,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:22,387 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-16 00:07:22,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840254861] [2019-11-16 00:07:22,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:22,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:22,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581647478] [2019-11-16 00:07:22,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:07:22,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:22,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:07:22,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:07:22,390 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 5 states. [2019-11-16 00:07:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:22,501 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-11-16 00:07:22,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:22,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-16 00:07:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:22,503 INFO L225 Difference]: With dead ends: 67 [2019-11-16 00:07:22,503 INFO L226 Difference]: Without dead ends: 62 [2019-11-16 00:07:22,504 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-16 00:07:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-16 00:07:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-16 00:07:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-16 00:07:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-11-16 00:07:22,507 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 23 [2019-11-16 00:07:22,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:22,507 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-11-16 00:07:22,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:07:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-11-16 00:07:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:07:22,508 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:22,508 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] [2019-11-16 00:07:22,509 INFO L410 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:22,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:22,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1590997555, now seen corresponding path program 1 times [2019-11-16 00:07:22,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:22,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387280372] [2019-11-16 00:07:22,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:22,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:22,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:22,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387280372] [2019-11-16 00:07:22,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:22,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:07:22,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312095608] [2019-11-16 00:07:22,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:22,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:22,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:22,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:22,552 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 4 states. [2019-11-16 00:07:22,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:22,647 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-11-16 00:07:22,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:22,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-16 00:07:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:22,649 INFO L225 Difference]: With dead ends: 64 [2019-11-16 00:07:22,649 INFO L226 Difference]: Without dead ends: 64 [2019-11-16 00:07:22,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:07:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-16 00:07:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-16 00:07:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-16 00:07:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-11-16 00:07:22,653 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 25 [2019-11-16 00:07:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:22,653 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-11-16 00:07:22,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-11-16 00:07:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:07:22,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:22,655 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] [2019-11-16 00:07:22,655 INFO L410 AbstractCegarLoop]: === Iteration 17 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:22,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:22,656 INFO L82 PathProgramCache]: Analyzing trace with hash 53849226, now seen corresponding path program 1 times [2019-11-16 00:07:22,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:22,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781714578] [2019-11-16 00:07:22,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:22,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:22,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:22,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781714578] [2019-11-16 00:07:22,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:22,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:07:22,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498538276] [2019-11-16 00:07:22,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:07:22,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:22,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:07:22,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:07:22,853 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 11 states. [2019-11-16 00:07:23,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:23,280 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-11-16 00:07:23,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:07:23,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-11-16 00:07:23,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:23,282 INFO L225 Difference]: With dead ends: 84 [2019-11-16 00:07:23,282 INFO L226 Difference]: Without dead ends: 84 [2019-11-16 00:07:23,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:07:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-16 00:07:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-11-16 00:07:23,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-16 00:07:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-11-16 00:07:23,286 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 27 [2019-11-16 00:07:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:23,287 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-11-16 00:07:23,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:07:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-11-16 00:07:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:07:23,288 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:23,288 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] [2019-11-16 00:07:23,288 INFO L410 AbstractCegarLoop]: === Iteration 18 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:23,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:23,289 INFO L82 PathProgramCache]: Analyzing trace with hash -763799224, now seen corresponding path program 1 times [2019-11-16 00:07:23,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:23,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393077345] [2019-11-16 00:07:23,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:23,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:23,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:23,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393077345] [2019-11-16 00:07:23,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:23,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-16 00:07:23,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726740477] [2019-11-16 00:07:23,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:07:23,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:23,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:07:23,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:07:23,536 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 13 states. [2019-11-16 00:07:24,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:24,130 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2019-11-16 00:07:24,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:07:24,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-11-16 00:07:24,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:24,131 INFO L225 Difference]: With dead ends: 106 [2019-11-16 00:07:24,132 INFO L226 Difference]: Without dead ends: 106 [2019-11-16 00:07:24,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:07:24,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-16 00:07:24,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 83. [2019-11-16 00:07:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-16 00:07:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-11-16 00:07:24,136 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 27 [2019-11-16 00:07:24,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:24,137 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-11-16 00:07:24,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:07:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-11-16 00:07:24,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:07:24,137 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:24,138 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-16 00:07:24,138 INFO L410 AbstractCegarLoop]: === Iteration 19 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:24,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:24,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1849780644, now seen corresponding path program 1 times [2019-11-16 00:07:24,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:24,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676662142] [2019-11-16 00:07:24,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:24,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:24,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:24,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676662142] [2019-11-16 00:07:24,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:24,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:07:24,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7286009] [2019-11-16 00:07:24,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:07:24,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:24,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:07:24,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:07:24,327 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 9 states. [2019-11-16 00:07:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:24,635 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2019-11-16 00:07:24,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:07:24,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-11-16 00:07:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:24,637 INFO L225 Difference]: With dead ends: 103 [2019-11-16 00:07:24,637 INFO L226 Difference]: Without dead ends: 78 [2019-11-16 00:07:24,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:07:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-16 00:07:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-16 00:07:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-16 00:07:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2019-11-16 00:07:24,641 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 28 [2019-11-16 00:07:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:24,641 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-11-16 00:07:24,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:07:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2019-11-16 00:07:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:07:24,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:24,642 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-16 00:07:24,642 INFO L410 AbstractCegarLoop]: === Iteration 20 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:24,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:24,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2068635362, now seen corresponding path program 1 times [2019-11-16 00:07:24,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:24,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488907957] [2019-11-16 00:07:24,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:24,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:24,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:24,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488907957] [2019-11-16 00:07:24,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:24,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:07:24,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059970654] [2019-11-16 00:07:24,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:07:24,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:24,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:07:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:07:24,855 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 10 states. [2019-11-16 00:07:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:25,219 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2019-11-16 00:07:25,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:07:25,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-11-16 00:07:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:25,221 INFO L225 Difference]: With dead ends: 106 [2019-11-16 00:07:25,221 INFO L226 Difference]: Without dead ends: 86 [2019-11-16 00:07:25,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:07:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-16 00:07:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2019-11-16 00:07:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-16 00:07:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2019-11-16 00:07:25,225 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 28 [2019-11-16 00:07:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:25,225 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2019-11-16 00:07:25,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:07:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2019-11-16 00:07:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-16 00:07:25,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:25,227 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, 1, 1, 1, 1] [2019-11-16 00:07:25,228 INFO L410 AbstractCegarLoop]: === Iteration 21 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1215695489, now seen corresponding path program 1 times [2019-11-16 00:07:25,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:25,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432771634] [2019-11-16 00:07:25,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:25,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:25,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,390 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-16 00:07:25,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432771634] [2019-11-16 00:07:25,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395823250] [2019-11-16 00:07:25,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:25,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:07:25,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:25,651 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:25,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-16 00:07:25,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503542217] [2019-11-16 00:07:25,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:07:25,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:25,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:07:25,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:07:25,655 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 16 states. [2019-11-16 00:07:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:26,213 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2019-11-16 00:07:26,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:07:26,213 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-11-16 00:07:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:26,214 INFO L225 Difference]: With dead ends: 146 [2019-11-16 00:07:26,214 INFO L226 Difference]: Without dead ends: 146 [2019-11-16 00:07:26,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:07:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-16 00:07:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 113. [2019-11-16 00:07:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-16 00:07:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-11-16 00:07:26,219 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 32 [2019-11-16 00:07:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:26,219 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-11-16 00:07:26,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:07:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-11-16 00:07:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:07:26,220 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:26,221 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:26,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:26,424 INFO L410 AbstractCegarLoop]: === Iteration 22 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:26,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:26,425 INFO L82 PathProgramCache]: Analyzing trace with hash 929596304, now seen corresponding path program 1 times [2019-11-16 00:07:26,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:26,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379411466] [2019-11-16 00:07:26,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:26,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:26,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:07:26,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379411466] [2019-11-16 00:07:26,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183789761] [2019-11-16 00:07:26,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:26,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:07:26,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:26,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:26,814 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-16 00:07:26,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:26,848 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:07:26,849 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-16 00:07:26,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:07:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:07:27,014 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:27,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-16 00:07:27,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921318087] [2019-11-16 00:07:27,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:07:27,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:27,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:07:27,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:07:27,016 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 18 states. [2019-11-16 00:07:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:27,672 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2019-11-16 00:07:27,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:07:27,675 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-11-16 00:07:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:27,676 INFO L225 Difference]: With dead ends: 149 [2019-11-16 00:07:27,676 INFO L226 Difference]: Without dead ends: 149 [2019-11-16 00:07:27,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:07:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-16 00:07:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2019-11-16 00:07:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-16 00:07:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 147 transitions. [2019-11-16 00:07:27,682 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 147 transitions. Word has length 35 [2019-11-16 00:07:27,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:27,682 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 147 transitions. [2019-11-16 00:07:27,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:07:27,683 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2019-11-16 00:07:27,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-16 00:07:27,683 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:27,683 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:27,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:27,889 INFO L410 AbstractCegarLoop]: === Iteration 23 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:27,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash -800192796, now seen corresponding path program 2 times [2019-11-16 00:07:27,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:27,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698971218] [2019-11-16 00:07:27,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:27,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:27,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:07:28,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698971218] [2019-11-16 00:07:28,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790377360] [2019-11-16 00:07:28,210 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:28,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:07:28,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:28,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:07:28,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:28,495 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-16 00:07:28,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:28,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:28,502 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-16 00:07:28,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-16 00:07:28,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:28,723 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 18 [2019-11-16 00:07:28,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:07:28,734 INFO L567 ElimStorePlain]: treesize reduction 8, result has 55.6 percent of original size [2019-11-16 00:07:28,735 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-16 00:07:28,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:3 [2019-11-16 00:07:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:07:28,768 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:28,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2019-11-16 00:07:28,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087486394] [2019-11-16 00:07:28,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-16 00:07:28,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:28,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-16 00:07:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:07:28,770 INFO L87 Difference]: Start difference. First operand 125 states and 147 transitions. Second operand 25 states. [2019-11-16 00:07:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:29,619 INFO L93 Difference]: Finished difference Result 188 states and 215 transitions. [2019-11-16 00:07:29,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:07:29,619 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2019-11-16 00:07:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:29,621 INFO L225 Difference]: With dead ends: 188 [2019-11-16 00:07:29,621 INFO L226 Difference]: Without dead ends: 188 [2019-11-16 00:07:29,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:07:29,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-16 00:07:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2019-11-16 00:07:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-16 00:07:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 199 transitions. [2019-11-16 00:07:29,628 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 199 transitions. Word has length 41 [2019-11-16 00:07:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:29,629 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 199 transitions. [2019-11-16 00:07:29,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-16 00:07:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 199 transitions. [2019-11-16 00:07:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:07:29,630 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:29,630 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-11-16 00:07:29,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:29,831 INFO L410 AbstractCegarLoop]: === Iteration 24 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:29,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:29,831 INFO L82 PathProgramCache]: Analyzing trace with hash 23212469, now seen corresponding path program 2 times [2019-11-16 00:07:29,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:29,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749078466] [2019-11-16 00:07:29,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:29,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:29,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:30,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749078466] [2019-11-16 00:07:30,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866547477] [2019-11-16 00:07:30,299 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:30,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:07:30,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:30,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-16 00:07:30,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:30,560 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-16 00:07:30,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:30,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:30,574 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-16 00:07:30,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-11-16 00:07:30,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:07:30,639 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 24 treesize of output 23 [2019-11-16 00:07:30,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:30,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:30,664 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-16 00:07:30,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2019-11-16 00:07:31,017 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:07:31,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:07:31,020 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:07:31,028 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:31,028 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 6 case distinctions, treesize of input 34 treesize of output 25 [2019-11-16 00:07:31,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:31,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:31,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:31,051 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-16 00:07:31,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:3 [2019-11-16 00:07:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:31,066 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:31,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2019-11-16 00:07:31,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336885826] [2019-11-16 00:07:31,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-16 00:07:31,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:31,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-16 00:07:31,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:07:31,068 INFO L87 Difference]: Start difference. First operand 170 states and 199 transitions. Second operand 26 states. [2019-11-16 00:07:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:31,881 INFO L93 Difference]: Finished difference Result 199 states and 228 transitions. [2019-11-16 00:07:31,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:07:31,885 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2019-11-16 00:07:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:31,887 INFO L225 Difference]: With dead ends: 199 [2019-11-16 00:07:31,887 INFO L226 Difference]: Without dead ends: 180 [2019-11-16 00:07:31,888 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=198, Invalid=1284, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:07:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-16 00:07:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 174. [2019-11-16 00:07:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-16 00:07:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 203 transitions. [2019-11-16 00:07:31,895 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 203 transitions. Word has length 43 [2019-11-16 00:07:31,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:31,895 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 203 transitions. [2019-11-16 00:07:31,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-16 00:07:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 203 transitions. [2019-11-16 00:07:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:07:31,897 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:31,897 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-11-16 00:07:32,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:32,101 INFO L410 AbstractCegarLoop]: === Iteration 25 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:32,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:32,101 INFO L82 PathProgramCache]: Analyzing trace with hash -371154317, now seen corresponding path program 1 times [2019-11-16 00:07:32,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:32,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088433796] [2019-11-16 00:07:32,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:32,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:32,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:32,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088433796] [2019-11-16 00:07:32,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140300358] [2019-11-16 00:07:32,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:32,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-16 00:07:32,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:32,890 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-16 00:07:32,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:32,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:32,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:32,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-16 00:07:32,992 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-16 00:07:32,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:33,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:33,002 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-16 00:07:33,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-16 00:07:33,043 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-16 00:07:33,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:33,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:33,056 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-16 00:07:33,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-11-16 00:07:33,426 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:07:33,427 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-16 00:07:33,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:33,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:33,440 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-16 00:07:33,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:49, output treesize:3 [2019-11-16 00:07:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:33,452 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:33,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2019-11-16 00:07:33,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482777386] [2019-11-16 00:07:33,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-16 00:07:33,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:33,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-16 00:07:33,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:07:33,454 INFO L87 Difference]: Start difference. First operand 174 states and 203 transitions. Second operand 26 states. [2019-11-16 00:07:34,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:34,743 INFO L93 Difference]: Finished difference Result 271 states and 309 transitions. [2019-11-16 00:07:34,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:07:34,743 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2019-11-16 00:07:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:34,744 INFO L225 Difference]: With dead ends: 271 [2019-11-16 00:07:34,744 INFO L226 Difference]: Without dead ends: 225 [2019-11-16 00:07:34,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=221, Invalid=1419, Unknown=0, NotChecked=0, Total=1640 [2019-11-16 00:07:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-16 00:07:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 216. [2019-11-16 00:07:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-16 00:07:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 251 transitions. [2019-11-16 00:07:34,752 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 251 transitions. Word has length 43 [2019-11-16 00:07:34,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:34,753 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 251 transitions. [2019-11-16 00:07:34,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-16 00:07:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 251 transitions. [2019-11-16 00:07:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:07:34,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:34,754 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 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-16 00:07:34,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:34,958 INFO L410 AbstractCegarLoop]: === Iteration 26 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:34,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2142950489, now seen corresponding path program 3 times [2019-11-16 00:07:34,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:34,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517131299] [2019-11-16 00:07:34,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:34,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:34,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:07:35,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517131299] [2019-11-16 00:07:35,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525422404] [2019-11-16 00:07:35,151 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:35,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:07:35,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:35,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:07:35,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:35,313 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:35,313 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-16 00:07:35,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:35,327 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:07:35,327 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-16 00:07:35,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:07:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:07:35,494 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:35,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-11-16 00:07:35,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424288596] [2019-11-16 00:07:35,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-16 00:07:35,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:35,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-16 00:07:35,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:07:35,496 INFO L87 Difference]: Start difference. First operand 216 states and 251 transitions. Second operand 23 states. [2019-11-16 00:07:36,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:36,370 INFO L93 Difference]: Finished difference Result 273 states and 311 transitions. [2019-11-16 00:07:36,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:07:36,370 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-11-16 00:07:36,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:36,374 INFO L225 Difference]: With dead ends: 273 [2019-11-16 00:07:36,374 INFO L226 Difference]: Without dead ends: 271 [2019-11-16 00:07:36,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:07:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-16 00:07:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 234. [2019-11-16 00:07:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-16 00:07:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2019-11-16 00:07:36,386 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 45 [2019-11-16 00:07:36,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:36,386 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2019-11-16 00:07:36,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-16 00:07:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2019-11-16 00:07:36,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:07:36,387 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:36,388 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:36,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:36,592 INFO L410 AbstractCegarLoop]: === Iteration 27 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:36,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:36,592 INFO L82 PathProgramCache]: Analyzing trace with hash 51080568, now seen corresponding path program 3 times [2019-11-16 00:07:36,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:36,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748830879] [2019-11-16 00:07:36,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:36,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:36,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:36,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748830879] [2019-11-16 00:07:36,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587854023] [2019-11-16 00:07:36,752 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:36,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:07:36,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:36,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-16 00:07:36,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:37,154 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:37,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-16 00:07:37,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738717399] [2019-11-16 00:07:37,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-16 00:07:37,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:37,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:07:37,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:07:37,155 INFO L87 Difference]: Start difference. First operand 234 states and 273 transitions. Second operand 21 states. [2019-11-16 00:07:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:37,826 INFO L93 Difference]: Finished difference Result 361 states and 414 transitions. [2019-11-16 00:07:37,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:07:37,834 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2019-11-16 00:07:37,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:37,836 INFO L225 Difference]: With dead ends: 361 [2019-11-16 00:07:37,836 INFO L226 Difference]: Without dead ends: 361 [2019-11-16 00:07:37,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:07:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-16 00:07:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 296. [2019-11-16 00:07:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-16 00:07:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 348 transitions. [2019-11-16 00:07:37,849 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 348 transitions. Word has length 47 [2019-11-16 00:07:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:37,850 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 348 transitions. [2019-11-16 00:07:37,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-16 00:07:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 348 transitions. [2019-11-16 00:07:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:07:37,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:37,851 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-16 00:07:38,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:38,058 INFO L410 AbstractCegarLoop]: === Iteration 28 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:38,058 INFO L82 PathProgramCache]: Analyzing trace with hash -608435781, now seen corresponding path program 4 times [2019-11-16 00:07:38,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:38,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305545669] [2019-11-16 00:07:38,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:38,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:38,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:38,438 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-11-16 00:07:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:39,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305545669] [2019-11-16 00:07:39,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984459094] [2019-11-16 00:07:39,311 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:39,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:07:39,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:39,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-16 00:07:39,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:39,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:39,475 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-16 00:07:39,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:39,491 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:07:39,491 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-16 00:07:39,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:07:39,699 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-16 00:07:39,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:39,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:39,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:39,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-16 00:07:40,047 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 24 treesize of output 18 [2019-11-16 00:07:40,048 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-16 00:07:40,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:40,070 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:07:40,072 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:40,073 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 17 treesize of output 10 [2019-11-16 00:07:40,073 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:40,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:40,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:40,081 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-11-16 00:07:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:07:40,089 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:40,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 34 [2019-11-16 00:07:40,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595221263] [2019-11-16 00:07:40,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-16 00:07:40,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:40,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-16 00:07:40,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:07:40,090 INFO L87 Difference]: Start difference. First operand 296 states and 348 transitions. Second operand 34 states. [2019-11-16 00:07:40,659 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-16 00:07:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:43,154 INFO L93 Difference]: Finished difference Result 473 states and 539 transitions. [2019-11-16 00:07:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-16 00:07:43,155 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-16 00:07:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:43,157 INFO L225 Difference]: With dead ends: 473 [2019-11-16 00:07:43,157 INFO L226 Difference]: Without dead ends: 450 [2019-11-16 00:07:43,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=517, Invalid=4175, Unknown=0, NotChecked=0, Total=4692 [2019-11-16 00:07:43,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-16 00:07:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 380. [2019-11-16 00:07:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-11-16 00:07:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 447 transitions. [2019-11-16 00:07:43,167 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 447 transitions. Word has length 51 [2019-11-16 00:07:43,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:43,168 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 447 transitions. [2019-11-16 00:07:43,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-16 00:07:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 447 transitions. [2019-11-16 00:07:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:07:43,169 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:43,169 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-16 00:07:43,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:43,370 INFO L410 AbstractCegarLoop]: === Iteration 29 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:43,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:43,370 INFO L82 PathProgramCache]: Analyzing trace with hash -699773250, now seen corresponding path program 5 times [2019-11-16 00:07:43,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:43,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571229242] [2019-11-16 00:07:43,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:43,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:43,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:07:43,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571229242] [2019-11-16 00:07:43,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733718995] [2019-11-16 00:07:43,617 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:43,780 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-16 00:07:43,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:43,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-16 00:07:43,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:43,803 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:43,803 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-16 00:07:43,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:43,822 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:07:43,822 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-16 00:07:43,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:07:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:07:43,940 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:43,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 17 [2019-11-16 00:07:43,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033152800] [2019-11-16 00:07:43,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:07:43,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:43,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:07:43,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:07:43,942 INFO L87 Difference]: Start difference. First operand 380 states and 447 transitions. Second operand 18 states. [2019-11-16 00:07:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:44,755 INFO L93 Difference]: Finished difference Result 478 states and 550 transitions. [2019-11-16 00:07:44,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:07:44,755 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-11-16 00:07:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:44,758 INFO L225 Difference]: With dead ends: 478 [2019-11-16 00:07:44,758 INFO L226 Difference]: Without dead ends: 476 [2019-11-16 00:07:44,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:07:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-11-16 00:07:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 404. [2019-11-16 00:07:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-11-16 00:07:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 477 transitions. [2019-11-16 00:07:44,773 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 477 transitions. Word has length 55 [2019-11-16 00:07:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:44,774 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 477 transitions. [2019-11-16 00:07:44,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:07:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 477 transitions. [2019-11-16 00:07:44,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:07:44,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:44,775 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-11-16 00:07:44,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:44,979 INFO L410 AbstractCegarLoop]: === Iteration 30 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:44,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:44,980 INFO L82 PathProgramCache]: Analyzing trace with hash 988427292, now seen corresponding path program 4 times [2019-11-16 00:07:44,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:44,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814538590] [2019-11-16 00:07:44,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:44,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:44,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:45,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814538590] [2019-11-16 00:07:45,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048324761] [2019-11-16 00:07:45,288 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:45,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:07:45,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:45,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-16 00:07:45,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:45,444 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_35|]} [2019-11-16 00:07:45,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:07:45,458 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-16 00:07:45,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:45,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:45,488 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-16 00:07:45,488 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:45,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:45,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:45,504 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-11-16 00:07:45,671 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-16 00:07:45,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:45,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:45,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:07:45,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-16 00:07:45,739 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-16 00:07:45,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:45,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:45,753 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-16 00:07:45,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-11-16 00:07:46,164 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-16 00:07:46,165 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-16 00:07:46,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:46,189 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:07:46,190 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-16 00:07:46,190 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:46,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:46,202 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-16 00:07:46,202 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:50, output treesize:3 [2019-11-16 00:07:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 34 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:46,222 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:46,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-11-16 00:07:46,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296282179] [2019-11-16 00:07:46,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-16 00:07:46,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:46,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-16 00:07:46,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:07:46,224 INFO L87 Difference]: Start difference. First operand 404 states and 477 transitions. Second operand 25 states. [2019-11-16 00:07:49,144 WARN L191 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-11-16 00:07:54,211 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 44 [2019-11-16 00:07:56,283 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-16 00:07:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:56,476 INFO L93 Difference]: Finished difference Result 649 states and 753 transitions. [2019-11-16 00:07:56,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:07:56,476 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2019-11-16 00:07:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:56,479 INFO L225 Difference]: With dead ends: 649 [2019-11-16 00:07:56,479 INFO L226 Difference]: Without dead ends: 521 [2019-11-16 00:07:56,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=206, Invalid=1600, Unknown=0, NotChecked=0, Total=1806 [2019-11-16 00:07:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-11-16 00:07:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 470. [2019-11-16 00:07:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-11-16 00:07:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 558 transitions. [2019-11-16 00:07:56,492 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 558 transitions. Word has length 58 [2019-11-16 00:07:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:56,492 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 558 transitions. [2019-11-16 00:07:56,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-16 00:07:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 558 transitions. [2019-11-16 00:07:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:07:56,494 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:56,494 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-16 00:07:56,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:56,699 INFO L410 AbstractCegarLoop]: === Iteration 31 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:56,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:56,699 INFO L82 PathProgramCache]: Analyzing trace with hash 348796818, now seen corresponding path program 6 times [2019-11-16 00:07:56,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:56,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839497622] [2019-11-16 00:07:56,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:56,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:56,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:07:57,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839497622] [2019-11-16 00:07:57,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364384766] [2019-11-16 00:07:57,010 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:57,150 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-16 00:07:57,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:57,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-16 00:07:57,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:57,309 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-16 00:07:57,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:07:57,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:07:57,318 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-16 00:07:57,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-16 00:07:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:07:57,522 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:57,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 31 [2019-11-16 00:07:57,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441085504] [2019-11-16 00:07:57,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-16 00:07:57,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:57,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-16 00:07:57,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:07:57,524 INFO L87 Difference]: Start difference. First operand 470 states and 558 transitions. Second operand 31 states. [2019-11-16 00:07:59,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:59,126 INFO L93 Difference]: Finished difference Result 726 states and 840 transitions. [2019-11-16 00:07:59,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-16 00:07:59,127 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2019-11-16 00:07:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:59,130 INFO L225 Difference]: With dead ends: 726 [2019-11-16 00:07:59,131 INFO L226 Difference]: Without dead ends: 644 [2019-11-16 00:07:59,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1833, Unknown=0, NotChecked=0, Total=2070 [2019-11-16 00:07:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-11-16 00:07:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 576. [2019-11-16 00:07:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-11-16 00:07:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 685 transitions. [2019-11-16 00:07:59,148 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 685 transitions. Word has length 61 [2019-11-16 00:07:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:59,149 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 685 transitions. [2019-11-16 00:07:59,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-16 00:07:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 685 transitions. [2019-11-16 00:07:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-16 00:07:59,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:59,151 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-11-16 00:07:59,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:59,355 INFO L410 AbstractCegarLoop]: === Iteration 32 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:07:59,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:59,355 INFO L82 PathProgramCache]: Analyzing trace with hash 39819769, now seen corresponding path program 5 times [2019-11-16 00:07:59,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:59,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771201033] [2019-11-16 00:07:59,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:59,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:59,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771201033] [2019-11-16 00:07:59,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168834713] [2019-11-16 00:07:59,590 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:07:59,783 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-16 00:07:59,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:07:59,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-16 00:07:59,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:59,993 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:59,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-11-16 00:07:59,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216619715] [2019-11-16 00:07:59,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-16 00:07:59,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:59,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:07:59,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:07:59,995 INFO L87 Difference]: Start difference. First operand 576 states and 685 transitions. Second operand 22 states. [2019-11-16 00:08:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:00,926 INFO L93 Difference]: Finished difference Result 816 states and 960 transitions. [2019-11-16 00:08:00,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:08:00,926 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2019-11-16 00:08:00,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:00,930 INFO L225 Difference]: With dead ends: 816 [2019-11-16 00:08:00,931 INFO L226 Difference]: Without dead ends: 816 [2019-11-16 00:08:00,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:08:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-11-16 00:08:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 696. [2019-11-16 00:08:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-16 00:08:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 830 transitions. [2019-11-16 00:08:00,949 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 830 transitions. Word has length 62 [2019-11-16 00:08:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:00,949 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 830 transitions. [2019-11-16 00:08:00,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-16 00:08:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 830 transitions. [2019-11-16 00:08:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:08:00,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:00,952 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-16 00:08:01,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:01,156 INFO L410 AbstractCegarLoop]: === Iteration 33 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:08:01,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:01,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1045060821, now seen corresponding path program 7 times [2019-11-16 00:08:01,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:01,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943444284] [2019-11-16 00:08:01,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:01,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:01,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:01,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943444284] [2019-11-16 00:08:01,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234690171] [2019-11-16 00:08:01,466 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:08:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:01,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-16 00:08:01,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:01,672 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:01,672 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-16 00:08:01,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:01,691 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:08:01,691 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-16 00:08:01,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:08:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:02,107 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:02,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2019-11-16 00:08:02,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92473145] [2019-11-16 00:08:02,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-16 00:08:02,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:02,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-16 00:08:02,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:08:02,108 INFO L87 Difference]: Start difference. First operand 696 states and 830 transitions. Second operand 30 states. [2019-11-16 00:08:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:03,255 INFO L93 Difference]: Finished difference Result 881 states and 1024 transitions. [2019-11-16 00:08:03,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:08:03,256 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-11-16 00:08:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:03,259 INFO L225 Difference]: With dead ends: 881 [2019-11-16 00:08:03,259 INFO L226 Difference]: Without dead ends: 879 [2019-11-16 00:08:03,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=187, Invalid=1219, Unknown=0, NotChecked=0, Total=1406 [2019-11-16 00:08:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-11-16 00:08:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 732. [2019-11-16 00:08:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-11-16 00:08:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 876 transitions. [2019-11-16 00:08:03,279 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 876 transitions. Word has length 65 [2019-11-16 00:08:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:03,279 INFO L462 AbstractCegarLoop]: Abstraction has 732 states and 876 transitions. [2019-11-16 00:08:03,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-16 00:08:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 876 transitions. [2019-11-16 00:08:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:08:03,281 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:03,281 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-16 00:08:03,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:03,485 INFO L410 AbstractCegarLoop]: === Iteration 34 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:08:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash -726198167, now seen corresponding path program 8 times [2019-11-16 00:08:03,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:03,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529788966] [2019-11-16 00:08:03,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:03,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:03,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 17 proven. 76 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:03,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529788966] [2019-11-16 00:08:03,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583295810] [2019-11-16 00:08:03,968 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:08:04,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:08:04,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:08:04,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-16 00:08:04,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:04,199 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:04,199 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-16 00:08:04,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:04,227 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:08:04,228 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-16 00:08:04,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:08:04,438 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-16 00:08:04,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:04,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:04,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:04,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-16 00:08:04,841 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:04,841 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-16 00:08:04,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:08:04,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:04,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:04,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-11-16 00:08:04,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:04,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 15 proven. 78 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:05,107 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:05,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2019-11-16 00:08:05,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261459895] [2019-11-16 00:08:05,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-16 00:08:05,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-16 00:08:05,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1378, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:08:05,109 INFO L87 Difference]: Start difference. First operand 732 states and 876 transitions. Second operand 39 states. [2019-11-16 00:08:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:09,560 INFO L93 Difference]: Finished difference Result 1344 states and 1539 transitions. [2019-11-16 00:08:09,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-16 00:08:09,561 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 71 [2019-11-16 00:08:09,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:09,566 INFO L225 Difference]: With dead ends: 1344 [2019-11-16 00:08:09,566 INFO L226 Difference]: Without dead ends: 1242 [2019-11-16 00:08:09,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=598, Invalid=5882, Unknown=0, NotChecked=0, Total=6480 [2019-11-16 00:08:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2019-11-16 00:08:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 927. [2019-11-16 00:08:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-11-16 00:08:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1116 transitions. [2019-11-16 00:08:09,590 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1116 transitions. Word has length 71 [2019-11-16 00:08:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:09,590 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 1116 transitions. [2019-11-16 00:08:09,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-16 00:08:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1116 transitions. [2019-11-16 00:08:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-16 00:08:09,592 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:09,592 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2019-11-16 00:08:09,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:09,796 INFO L410 AbstractCegarLoop]: === Iteration 35 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:08:09,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:09,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2012816133, now seen corresponding path program 6 times [2019-11-16 00:08:09,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:09,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179418460] [2019-11-16 00:08:09,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:09,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:09,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 31 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:10,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179418460] [2019-11-16 00:08:10,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784145422] [2019-11-16 00:08:10,133 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:08:10,304 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-16 00:08:10,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:08:10,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-16 00:08:10,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:10,520 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-16 00:08:10,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:10,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:10,531 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-16 00:08:10,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-11-16 00:08:10,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:10,603 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-16 00:08:10,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:10,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:10,612 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-16 00:08:10,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2019-11-16 00:08:12,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:12,665 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-16 00:08:12,665 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:12,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 65 treesize of output 191 [2019-11-16 00:08:12,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:12,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:12,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:12,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:12,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:12,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:12,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:12,757 INFO L567 ElimStorePlain]: treesize reduction 113, result has 33.5 percent of original size [2019-11-16 00:08:12,760 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-16 00:08:12,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:71, output treesize:7 [2019-11-16 00:08:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:12,854 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:12,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 31] total 45 [2019-11-16 00:08:12,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704438565] [2019-11-16 00:08:12,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-16 00:08:12,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:12,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-16 00:08:12,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1863, Unknown=0, NotChecked=0, Total=1980 [2019-11-16 00:08:12,856 INFO L87 Difference]: Start difference. First operand 927 states and 1116 transitions. Second operand 45 states. [2019-11-16 00:08:14,650 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-11-16 00:08:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:16,948 INFO L93 Difference]: Finished difference Result 1553 states and 1845 transitions. [2019-11-16 00:08:16,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-16 00:08:16,948 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 73 [2019-11-16 00:08:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:16,953 INFO L225 Difference]: With dead ends: 1553 [2019-11-16 00:08:16,953 INFO L226 Difference]: Without dead ends: 1131 [2019-11-16 00:08:16,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=452, Invalid=5868, Unknown=0, NotChecked=0, Total=6320 [2019-11-16 00:08:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2019-11-16 00:08:16,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1013. [2019-11-16 00:08:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2019-11-16 00:08:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1221 transitions. [2019-11-16 00:08:16,978 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1221 transitions. Word has length 73 [2019-11-16 00:08:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:16,979 INFO L462 AbstractCegarLoop]: Abstraction has 1013 states and 1221 transitions. [2019-11-16 00:08:16,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-16 00:08:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1221 transitions. [2019-11-16 00:08:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-16 00:08:16,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:16,982 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2019-11-16 00:08:17,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:17,186 INFO L410 AbstractCegarLoop]: === Iteration 36 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:08:17,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:17,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1889050242, now seen corresponding path program 7 times [2019-11-16 00:08:17,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:17,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69491051] [2019-11-16 00:08:17,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:17,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:17,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:17,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69491051] [2019-11-16 00:08:17,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483841349] [2019-11-16 00:08:17,491 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:08:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:17,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-16 00:08:17,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:17,911 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:17,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2019-11-16 00:08:17,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573574087] [2019-11-16 00:08:17,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-16 00:08:17,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:17,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-16 00:08:17,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:08:17,912 INFO L87 Difference]: Start difference. First operand 1013 states and 1221 transitions. Second operand 25 states. [2019-11-16 00:08:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:19,067 INFO L93 Difference]: Finished difference Result 1347 states and 1611 transitions. [2019-11-16 00:08:19,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:08:19,068 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-11-16 00:08:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:19,073 INFO L225 Difference]: With dead ends: 1347 [2019-11-16 00:08:19,073 INFO L226 Difference]: Without dead ends: 1347 [2019-11-16 00:08:19,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2019-11-16 00:08:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-11-16 00:08:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1180. [2019-11-16 00:08:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-11-16 00:08:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1425 transitions. [2019-11-16 00:08:19,099 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1425 transitions. Word has length 77 [2019-11-16 00:08:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:19,100 INFO L462 AbstractCegarLoop]: Abstraction has 1180 states and 1425 transitions. [2019-11-16 00:08:19,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-16 00:08:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1425 transitions. [2019-11-16 00:08:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:08:19,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:19,103 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-16 00:08:19,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:19,306 INFO L410 AbstractCegarLoop]: === Iteration 37 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:08:19,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:19,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2140214336, now seen corresponding path program 9 times [2019-11-16 00:08:19,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:19,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308141837] [2019-11-16 00:08:19,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:19,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:19,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:19,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308141837] [2019-11-16 00:08:19,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991214723] [2019-11-16 00:08:19,886 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:08:20,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-16 00:08:20,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:08:20,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-16 00:08:20,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:20,428 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-16 00:08:20,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:20,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:20,436 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-16 00:08:20,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-16 00:08:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:20,737 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:20,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 37 [2019-11-16 00:08:20,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567470931] [2019-11-16 00:08:20,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-16 00:08:20,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:20,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-16 00:08:20,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2019-11-16 00:08:20,739 INFO L87 Difference]: Start difference. First operand 1180 states and 1425 transitions. Second operand 37 states. [2019-11-16 00:08:23,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:23,312 INFO L93 Difference]: Finished difference Result 1772 states and 2090 transitions. [2019-11-16 00:08:23,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-16 00:08:23,317 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2019-11-16 00:08:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:23,326 INFO L225 Difference]: With dead ends: 1772 [2019-11-16 00:08:23,326 INFO L226 Difference]: Without dead ends: 1577 [2019-11-16 00:08:23,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=299, Invalid=2781, Unknown=0, NotChecked=0, Total=3080 [2019-11-16 00:08:23,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2019-11-16 00:08:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1408. [2019-11-16 00:08:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1408 states. [2019-11-16 00:08:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1706 transitions. [2019-11-16 00:08:23,361 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1706 transitions. Word has length 81 [2019-11-16 00:08:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:23,362 INFO L462 AbstractCegarLoop]: Abstraction has 1408 states and 1706 transitions. [2019-11-16 00:08:23,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-16 00:08:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1706 transitions. [2019-11-16 00:08:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:08:23,365 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:23,365 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-11-16 00:08:23,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:23,570 INFO L410 AbstractCegarLoop]: === Iteration 38 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:08:23,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:23,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1351940611, now seen corresponding path program 10 times [2019-11-16 00:08:23,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:23,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141327741] [2019-11-16 00:08:23,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:23,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:23,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 47 proven. 115 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:23,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141327741] [2019-11-16 00:08:23,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288716764] [2019-11-16 00:08:23,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_112721ab-b921-434f-974a-88f97023d10f/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-16 00:08:24,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:08:24,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:08:24,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-16 00:08:24,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:24,168 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:24,168 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-16 00:08:24,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:24,189 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-16 00:08:24,190 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-16 00:08:24,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-11-16 00:08:24,196 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-16 00:08:24,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:24,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:24,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:24,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-16 00:08:24,540 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:24,541 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-16 00:08:24,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:08:24,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:24,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:24,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-16 00:08:24,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:24,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 65 proven. 31 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-16 00:08:24,687 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:24,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 32 [2019-11-16 00:08:24,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641530670] [2019-11-16 00:08:24,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-16 00:08:24,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:24,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-16 00:08:24,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2019-11-16 00:08:24,688 INFO L87 Difference]: Start difference. First operand 1408 states and 1706 transitions. Second operand 33 states. [2019-11-16 00:08:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:27,905 INFO L93 Difference]: Finished difference Result 2147 states and 2431 transitions. [2019-11-16 00:08:27,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-16 00:08:27,906 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 85 [2019-11-16 00:08:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:27,913 INFO L225 Difference]: With dead ends: 2147 [2019-11-16 00:08:27,913 INFO L226 Difference]: Without dead ends: 1822 [2019-11-16 00:08:27,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=621, Invalid=3411, Unknown=0, NotChecked=0, Total=4032 [2019-11-16 00:08:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2019-11-16 00:08:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 973. [2019-11-16 00:08:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-11-16 00:08:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1155 transitions. [2019-11-16 00:08:27,936 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1155 transitions. Word has length 85 [2019-11-16 00:08:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:27,936 INFO L462 AbstractCegarLoop]: Abstraction has 973 states and 1155 transitions. [2019-11-16 00:08:27,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-16 00:08:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1155 transitions. [2019-11-16 00:08:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:08:27,939 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:27,939 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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] [2019-11-16 00:08:28,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:28,143 INFO L410 AbstractCegarLoop]: === Iteration 39 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:08:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:28,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2004328534, now seen corresponding path program 8 times [2019-11-16 00:08:28,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:28,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983539832] [2019-11-16 00:08:28,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:28,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:28,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 41 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:28,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983539832] [2019-11-16 00:08:28,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519958940] [2019-11-16 00:08:28,499 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:08:28,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:08:28,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:08:28,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-16 00:08:28,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:28,664 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-16 00:08:28,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:28,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:28,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:28,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-16 00:08:28,897 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-16 00:08:28,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:28,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:28,938 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-16 00:08:28,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-16 00:08:28,987 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-16 00:08:28,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:28,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:28,997 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-16 00:08:28,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2019-11-16 00:08:29,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:29,658 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 28 treesize of output 21 [2019-11-16 00:08:29,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:08:29,674 INFO L567 ElimStorePlain]: treesize reduction 8, result has 63.6 percent of original size [2019-11-16 00:08:29,675 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-16 00:08:29,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2019-11-16 00:08:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 41 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:29,727 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:29,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2019-11-16 00:08:29,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194418411] [2019-11-16 00:08:29,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-16 00:08:29,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:29,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-16 00:08:29,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2019-11-16 00:08:29,730 INFO L87 Difference]: Start difference. First operand 973 states and 1155 transitions. Second operand 33 states. [2019-11-16 00:08:34,105 WARN L191 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:08:38,561 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:08:42,931 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:08:47,347 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:08:51,471 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-16 00:08:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:51,583 INFO L93 Difference]: Finished difference Result 1737 states and 2049 transitions. [2019-11-16 00:08:51,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:08:51,583 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 88 [2019-11-16 00:08:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:51,587 INFO L225 Difference]: With dead ends: 1737 [2019-11-16 00:08:51,587 INFO L226 Difference]: Without dead ends: 987 [2019-11-16 00:08:51,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=167, Invalid=1725, Unknown=0, NotChecked=0, Total=1892 [2019-11-16 00:08:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-11-16 00:08:51,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 981. [2019-11-16 00:08:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-11-16 00:08:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1163 transitions. [2019-11-16 00:08:51,604 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1163 transitions. Word has length 88 [2019-11-16 00:08:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:51,604 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 1163 transitions. [2019-11-16 00:08:51,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-16 00:08:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1163 transitions. [2019-11-16 00:08:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-16 00:08:51,607 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:51,607 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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] [2019-11-16 00:08:51,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:51,811 INFO L410 AbstractCegarLoop]: === Iteration 40 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:08:51,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:51,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1747133811, now seen corresponding path program 9 times [2019-11-16 00:08:51,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:51,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464246840] [2019-11-16 00:08:51,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:51,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:51,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 30 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:52,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464246840] [2019-11-16 00:08:52,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168966786] [2019-11-16 00:08:52,141 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:08:52,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-16 00:08:52,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:08:52,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-16 00:08:52,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:52,341 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_34|], 1=[|v_#valid_37|]} [2019-11-16 00:08:52,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:52,346 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-16 00:08:52,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:52,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:52,364 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-16 00:08:52,364 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:52,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:52,372 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-16 00:08:52,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-11-16 00:08:52,723 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 28 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:52,723 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:52,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2019-11-16 00:08:52,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982715605] [2019-11-16 00:08:52,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-16 00:08:52,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:52,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-16 00:08:52,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:08:52,724 INFO L87 Difference]: Start difference. First operand 981 states and 1163 transitions. Second operand 32 states. [2019-11-16 00:08:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:54,284 INFO L93 Difference]: Finished difference Result 1300 states and 1546 transitions. [2019-11-16 00:08:54,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:08:54,285 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 92 [2019-11-16 00:08:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:54,289 INFO L225 Difference]: With dead ends: 1300 [2019-11-16 00:08:54,290 INFO L226 Difference]: Without dead ends: 1300 [2019-11-16 00:08:54,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=255, Invalid=1725, Unknown=0, NotChecked=0, Total=1980 [2019-11-16 00:08:54,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-11-16 00:08:54,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1151. [2019-11-16 00:08:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-11-16 00:08:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1365 transitions. [2019-11-16 00:08:54,308 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1365 transitions. Word has length 92 [2019-11-16 00:08:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:54,308 INFO L462 AbstractCegarLoop]: Abstraction has 1151 states and 1365 transitions. [2019-11-16 00:08:54,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-16 00:08:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1365 transitions. [2019-11-16 00:08:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-16 00:08:54,311 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:54,312 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-11-16 00:08:54,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:54,516 INFO L410 AbstractCegarLoop]: === Iteration 41 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:08:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash 433537345, now seen corresponding path program 10 times [2019-11-16 00:08:54,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:54,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139259746] [2019-11-16 00:08:54,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:54,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:54,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 51 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:54,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139259746] [2019-11-16 00:08:54,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373555041] [2019-11-16 00:08:54,918 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:08:55,099 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:08:55,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:08:55,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-16 00:08:55,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:55,105 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_35|], 1=[|v_#valid_38|]} [2019-11-16 00:08:55,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:55,109 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-16 00:08:55,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:55,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:55,121 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-16 00:08:55,122 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:55,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:55,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:55,130 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-11-16 00:08:55,391 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-16 00:08:55,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:55,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:55,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:55,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-16 00:08:55,440 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-16 00:08:55,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:55,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:55,448 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-16 00:08:55,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-11-16 00:08:56,082 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-16 00:08:56,083 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-16 00:08:56,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:56,117 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:08:56,118 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-16 00:08:56,118 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:56,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:56,130 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-16 00:08:56,130 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:50, output treesize:3 [2019-11-16 00:08:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 166 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:56,216 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:56,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2019-11-16 00:08:56,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892046421] [2019-11-16 00:08:56,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-16 00:08:56,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:56,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-16 00:08:56,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2019-11-16 00:08:56,219 INFO L87 Difference]: Start difference. First operand 1151 states and 1365 transitions. Second operand 37 states. [2019-11-16 00:08:59,231 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-11-16 00:09:01,578 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-16 00:09:04,410 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-16 00:09:06,821 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-16 00:09:09,163 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-16 00:09:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:09,389 INFO L93 Difference]: Finished difference Result 2085 states and 2461 transitions. [2019-11-16 00:09:09,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:09:09,389 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 103 [2019-11-16 00:09:09,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:09,396 INFO L225 Difference]: With dead ends: 2085 [2019-11-16 00:09:09,396 INFO L226 Difference]: Without dead ends: 1165 [2019-11-16 00:09:09,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=275, Invalid=2695, Unknown=0, NotChecked=0, Total=2970 [2019-11-16 00:09:09,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-11-16 00:09:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1159. [2019-11-16 00:09:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-11-16 00:09:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1373 transitions. [2019-11-16 00:09:09,411 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1373 transitions. Word has length 103 [2019-11-16 00:09:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:09,411 INFO L462 AbstractCegarLoop]: Abstraction has 1159 states and 1373 transitions. [2019-11-16 00:09:09,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-16 00:09:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1373 transitions. [2019-11-16 00:09:09,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-16 00:09:09,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:09,414 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-11-16 00:09:09,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:09,618 INFO L410 AbstractCegarLoop]: === Iteration 42 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:09:09,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:09,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1281933692, now seen corresponding path program 11 times [2019-11-16 00:09:09,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:09,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028076681] [2019-11-16 00:09:09,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:09,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:09,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 47 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:10,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028076681] [2019-11-16 00:09:10,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666483487] [2019-11-16 00:09:10,068 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:09:10,330 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-16 00:09:10,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:09:10,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-16 00:09:10,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 45 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:10,727 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:10,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 29 [2019-11-16 00:09:10,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510200441] [2019-11-16 00:09:10,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-16 00:09:10,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:10,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-16 00:09:10,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:09:10,730 INFO L87 Difference]: Start difference. First operand 1159 states and 1373 transitions. Second operand 30 states. [2019-11-16 00:09:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:12,364 INFO L93 Difference]: Finished difference Result 1478 states and 1756 transitions. [2019-11-16 00:09:12,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:09:12,365 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 107 [2019-11-16 00:09:12,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:12,370 INFO L225 Difference]: With dead ends: 1478 [2019-11-16 00:09:12,371 INFO L226 Difference]: Without dead ends: 1478 [2019-11-16 00:09:12,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=1348, Unknown=0, NotChecked=0, Total=1560 [2019-11-16 00:09:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2019-11-16 00:09:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1329. [2019-11-16 00:09:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2019-11-16 00:09:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1575 transitions. [2019-11-16 00:09:12,387 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1575 transitions. Word has length 107 [2019-11-16 00:09:12,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:12,388 INFO L462 AbstractCegarLoop]: Abstraction has 1329 states and 1575 transitions. [2019-11-16 00:09:12,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-16 00:09:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1575 transitions. [2019-11-16 00:09:12,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-16 00:09:12,391 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:12,391 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 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] [2019-11-16 00:09:12,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:12,595 INFO L410 AbstractCegarLoop]: === Iteration 43 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:09:12,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1177189488, now seen corresponding path program 12 times [2019-11-16 00:09:12,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:12,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500902666] [2019-11-16 00:09:12,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:12,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:12,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 61 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:13,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500902666] [2019-11-16 00:09:13,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478953907] [2019-11-16 00:09:13,264 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:09:13,524 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-16 00:09:13,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:09:13,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-16 00:09:13,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:13,541 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-16 00:09:13,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:13,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:13,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:13,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-16 00:09:13,829 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-16 00:09:13,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:13,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:13,842 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-16 00:09:13,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-16 00:09:13,932 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-16 00:09:13,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:13,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:13,949 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-16 00:09:13,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2019-11-16 00:09:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 61 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:15,002 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:15,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2019-11-16 00:09:15,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306792612] [2019-11-16 00:09:15,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-16 00:09:15,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:15,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-16 00:09:15,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1619, Unknown=0, NotChecked=0, Total=1722 [2019-11-16 00:09:15,004 INFO L87 Difference]: Start difference. First operand 1329 states and 1575 transitions. Second operand 42 states. [2019-11-16 00:09:20,034 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:09:24,416 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:09:28,786 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:09:33,098 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:09:35,444 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:09:39,785 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-16 00:09:43,903 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-16 00:09:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:43,984 INFO L93 Difference]: Finished difference Result 2433 states and 2873 transitions. [2019-11-16 00:09:43,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-16 00:09:43,984 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 118 [2019-11-16 00:09:43,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:43,991 INFO L225 Difference]: With dead ends: 2433 [2019-11-16 00:09:43,991 INFO L226 Difference]: Without dead ends: 1343 [2019-11-16 00:09:43,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2019-11-16 00:09:43,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-11-16 00:09:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1337. [2019-11-16 00:09:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-11-16 00:09:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1583 transitions. [2019-11-16 00:09:44,009 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1583 transitions. Word has length 118 [2019-11-16 00:09:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:44,009 INFO L462 AbstractCegarLoop]: Abstraction has 1337 states and 1583 transitions. [2019-11-16 00:09:44,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-16 00:09:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1583 transitions. [2019-11-16 00:09:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-16 00:09:44,012 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:44,012 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 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] [2019-11-16 00:09:44,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:44,217 INFO L410 AbstractCegarLoop]: === Iteration 44 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:09:44,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:44,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1146554387, now seen corresponding path program 13 times [2019-11-16 00:09:44,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:44,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266446002] [2019-11-16 00:09:44,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:44,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:44,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 68 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:44,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266446002] [2019-11-16 00:09:44,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604430815] [2019-11-16 00:09:44,607 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:09:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:44,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-16 00:09:44,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 66 proven. 263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:45,110 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:45,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 33 [2019-11-16 00:09:45,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241646834] [2019-11-16 00:09:45,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-16 00:09:45,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:45,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-16 00:09:45,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:09:45,112 INFO L87 Difference]: Start difference. First operand 1337 states and 1583 transitions. Second operand 34 states. [2019-11-16 00:09:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:46,584 INFO L93 Difference]: Finished difference Result 1656 states and 1966 transitions. [2019-11-16 00:09:46,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:09:46,584 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 122 [2019-11-16 00:09:46,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:46,591 INFO L225 Difference]: With dead ends: 1656 [2019-11-16 00:09:46,591 INFO L226 Difference]: Without dead ends: 1656 [2019-11-16 00:09:46,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=1726, Unknown=0, NotChecked=0, Total=1980 [2019-11-16 00:09:46,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2019-11-16 00:09:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1507. [2019-11-16 00:09:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2019-11-16 00:09:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1785 transitions. [2019-11-16 00:09:46,613 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1785 transitions. Word has length 122 [2019-11-16 00:09:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:46,614 INFO L462 AbstractCegarLoop]: Abstraction has 1507 states and 1785 transitions. [2019-11-16 00:09:46,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-16 00:09:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1785 transitions. [2019-11-16 00:09:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-16 00:09:46,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:46,616 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 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] [2019-11-16 00:09:46,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:46,817 INFO L410 AbstractCegarLoop]: === Iteration 45 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:09:46,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:46,817 INFO L82 PathProgramCache]: Analyzing trace with hash 897777287, now seen corresponding path program 14 times [2019-11-16 00:09:46,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:46,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806606109] [2019-11-16 00:09:46,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:46,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:46,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 71 proven. 336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:47,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806606109] [2019-11-16 00:09:47,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654308414] [2019-11-16 00:09:47,628 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:09:47,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:09:47,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:09:47,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-16 00:09:47,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:48,355 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-16 00:09:48,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:48,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:48,378 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-16 00:09:48,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-11-16 00:09:48,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:48,479 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-16 00:09:48,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:48,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:48,496 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-16 00:09:48,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2019-11-16 00:09:49,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:49,433 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:49,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 32 [2019-11-16 00:09:49,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:49,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:49,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:49,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:49,447 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-16 00:09:49,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2019-11-16 00:09:49,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 66 proven. 341 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:49,766 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:49,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 49 [2019-11-16 00:09:49,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841671038] [2019-11-16 00:09:49,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-11-16 00:09:49,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:49,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-11-16 00:09:49,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2223, Unknown=0, NotChecked=0, Total=2352 [2019-11-16 00:09:49,768 INFO L87 Difference]: Start difference. First operand 1507 states and 1785 transitions. Second operand 49 states. [2019-11-16 00:09:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:57,021 INFO L93 Difference]: Finished difference Result 2980 states and 3483 transitions. [2019-11-16 00:09:57,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-11-16 00:09:57,022 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 133 [2019-11-16 00:09:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:57,028 INFO L225 Difference]: With dead ends: 2980 [2019-11-16 00:09:57,028 INFO L226 Difference]: Without dead ends: 1637 [2019-11-16 00:09:57,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2170 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=637, Invalid=10075, Unknown=0, NotChecked=0, Total=10712 [2019-11-16 00:09:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2019-11-16 00:09:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1530. [2019-11-16 00:09:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1530 states. [2019-11-16 00:09:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1808 transitions. [2019-11-16 00:09:57,051 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 1808 transitions. Word has length 133 [2019-11-16 00:09:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:57,051 INFO L462 AbstractCegarLoop]: Abstraction has 1530 states and 1808 transitions. [2019-11-16 00:09:57,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-11-16 00:09:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1808 transitions. [2019-11-16 00:09:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-16 00:09:57,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:57,055 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 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] [2019-11-16 00:09:57,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:57,259 INFO L410 AbstractCegarLoop]: === Iteration 46 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:09:57,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:57,260 INFO L82 PathProgramCache]: Analyzing trace with hash 638895304, now seen corresponding path program 2 times [2019-11-16 00:09:57,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:57,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083364808] [2019-11-16 00:09:57,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:57,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:57,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 93 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:57,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083364808] [2019-11-16 00:09:57,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436499879] [2019-11-16 00:09:57,742 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:09:57,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:09:57,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:09:57,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-16 00:09:57,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 91 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:09:58,488 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:58,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 35 [2019-11-16 00:09:58,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131310230] [2019-11-16 00:09:58,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-16 00:09:58,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:58,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-16 00:09:58,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1085, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:09:58,492 INFO L87 Difference]: Start difference. First operand 1530 states and 1808 transitions. Second operand 36 states. [2019-11-16 00:10:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:00,363 INFO L93 Difference]: Finished difference Result 1929 states and 2271 transitions. [2019-11-16 00:10:00,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-16 00:10:00,363 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 137 [2019-11-16 00:10:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:00,370 INFO L225 Difference]: With dead ends: 1929 [2019-11-16 00:10:00,370 INFO L226 Difference]: Without dead ends: 1929 [2019-11-16 00:10:00,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=289, Invalid=1967, Unknown=0, NotChecked=0, Total=2256 [2019-11-16 00:10:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2019-11-16 00:10:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1685. [2019-11-16 00:10:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2019-11-16 00:10:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 1995 transitions. [2019-11-16 00:10:00,386 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 1995 transitions. Word has length 137 [2019-11-16 00:10:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:00,386 INFO L462 AbstractCegarLoop]: Abstraction has 1685 states and 1995 transitions. [2019-11-16 00:10:00,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-16 00:10:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1995 transitions. [2019-11-16 00:10:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-16 00:10:00,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:00,390 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 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] [2019-11-16 00:10:00,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:00,590 INFO L410 AbstractCegarLoop]: === Iteration 47 === [cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-16 00:10:00,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash -666616374, now seen corresponding path program 15 times [2019-11-16 00:10:00,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:00,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686713736] [2019-11-16 00:10:00,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:00,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:00,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 81 proven. 444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:10:01,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686713736] [2019-11-16 00:10:01,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237728074] [2019-11-16 00:10:01,522 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/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-16 00:10:01,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-16 00:10:01,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:10:01,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-16 00:10:01,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:01,889 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_40|]} [2019-11-16 00:10:01,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:10:01,898 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-16 00:10:01,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:01,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:01,920 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-16 00:10:01,921 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:01,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:01,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:10:01,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-11-16 00:10:02,002 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-16 00:10:02,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:02,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:02,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:10:02,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-16 00:10:02,083 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-16 00:10:02,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:02,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:02,096 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-16 00:10:02,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-11-16 00:10:04,857 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-16 00:10:06,950 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-16 00:10:06,979 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:06,980 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 39 treesize of output 71 [2019-11-16 00:10:06,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:06,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:06,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:06,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:06,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:10:06,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:27 [2019-11-16 00:10:13,327 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 19 [2019-11-16 00:10:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 64 proven. 25 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2019-11-16 00:10:14,864 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:10:14,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16] total 41 [2019-11-16 00:10:14,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512042825] [2019-11-16 00:10:14,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-16 00:10:14,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:14,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-16 00:10:14,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1532, Unknown=5, NotChecked=0, Total=1640 [2019-11-16 00:10:14,865 INFO L87 Difference]: Start difference. First operand 1685 states and 1995 transitions. Second operand 41 states. [2019-11-16 00:10:18,465 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-16 00:10:18,992 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-16 00:10:24,554 WARN L191 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-16 00:10:26,872 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-11-16 00:10:27,165 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-16 00:10:35,504 WARN L191 SmtUtils]: Spent 8.16 s on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-11-16 00:10:35,718 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-16 00:10:40,466 WARN L191 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-11-16 00:10:51,149 WARN L191 SmtUtils]: Spent 4.68 s on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-16 00:10:57,858 WARN L191 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-16 00:11:02,752 WARN L191 SmtUtils]: Spent 4.82 s on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-16 00:11:11,416 WARN L191 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-11-16 00:11:11,742 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-16 00:11:22,283 WARN L191 SmtUtils]: Spent 5.04 s on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-16 00:11:27,342 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-11-16 00:11:42,892 WARN L191 SmtUtils]: Spent 8.52 s on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-11-16 00:11:49,751 WARN L191 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-11-16 00:12:01,229 WARN L191 SmtUtils]: Spent 8.30 s on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-11-16 00:12:10,358 WARN L191 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 48 [2019-11-16 00:12:21,921 WARN L191 SmtUtils]: Spent 8.15 s on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-11-16 00:12:27,485 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-16 00:12:39,427 WARN L191 SmtUtils]: Spent 8.10 s on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-11-16 00:12:49,674 WARN L191 SmtUtils]: Spent 6.47 s on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-11-16 00:13:00,437 WARN L191 SmtUtils]: Spent 7.31 s on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-16 00:13:07,118 WARN L191 SmtUtils]: Spent 4.96 s on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-16 00:13:09,232 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 48 [2019-11-16 00:13:13,379 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-11-16 00:13:20,737 WARN L191 SmtUtils]: Spent 7.24 s on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-16 00:13:22,851 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-16 00:13:33,376 WARN L191 SmtUtils]: Spent 7.23 s on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-16 00:13:39,252 WARN L191 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-16 00:13:44,966 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-16 00:13:52,377 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-11-16 00:13:57,862 WARN L191 SmtUtils]: Spent 3.84 s on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-16 00:14:04,675 WARN L191 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-11-16 00:14:11,839 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-11-16 00:14:19,126 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-16 00:14:24,571 WARN L191 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-16 00:14:29,656 WARN L191 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-11-16 00:14:33,815 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-11-16 00:14:45,332 WARN L191 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-16 00:14:53,141 WARN L191 SmtUtils]: Spent 6.50 s on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-16 00:14:55,267 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 48 [2019-11-16 00:14:57,363 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-16 00:15:03,482 WARN L191 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-16 00:15:05,963 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-11-16 00:15:11,766 WARN L191 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-16 00:15:22,516 WARN L191 SmtUtils]: Spent 6.27 s on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-11-16 00:15:28,740 WARN L191 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-16 00:15:32,904 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-16 00:15:38,357 WARN L191 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-11-16 00:15:45,842 WARN L191 SmtUtils]: Spent 6.31 s on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-16 00:15:47,707 WARN L191 SmtUtils]: Spent 1.78 s on a formula simplification that was a NOOP. DAG size: 48 [2019-11-16 00:15:48,753 WARN L191 SmtUtils]: Spent 972.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-16 00:15:53,597 WARN L191 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-16 00:16:02,067 WARN L191 SmtUtils]: Spent 5.00 s on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-16 00:16:08,274 WARN L191 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-16 00:16:21,206 WARN L191 SmtUtils]: Spent 6.60 s on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-11-16 00:16:32,797 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-16 00:16:37,042 WARN L191 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-16 00:16:42,441 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-11-16 00:16:50,267 WARN L191 SmtUtils]: Spent 6.53 s on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-16 00:16:52,435 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 48 [2019-11-16 00:16:54,544 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-16 00:16:59,451 WARN L191 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-16 00:17:06,184 WARN L191 SmtUtils]: Spent 5.43 s on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-16 00:17:12,557 WARN L191 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-16 00:17:19,250 WARN L191 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-11-16 00:17:24,825 WARN L191 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-16 00:17:31,348 WARN L191 SmtUtils]: Spent 5.19 s on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-16 00:17:39,643 WARN L191 SmtUtils]: Spent 5.60 s on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-11-16 00:17:48,322 WARN L191 SmtUtils]: Spent 7.36 s on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-11-16 00:17:49,899 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 48 [2019-11-16 00:17:52,052 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-16 00:17:56,005 WARN L191 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-16 00:18:02,598 WARN L191 SmtUtils]: Spent 6.51 s on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-16 00:18:12,541 WARN L191 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-11-16 00:18:19,304 WARN L191 SmtUtils]: Spent 6.57 s on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-16 00:18:29,668 WARN L191 SmtUtils]: Spent 8.99 s on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-16 00:18:35,214 WARN L191 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-11-16 00:18:41,813 WARN L191 SmtUtils]: Spent 6.53 s on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-16 00:18:43,046 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-16 00:18:43,703 WARN L191 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-16 00:18:50,364 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-16 00:18:55,356 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-16 00:18:59,766 WARN L191 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-11-16 00:19:07,646 WARN L191 SmtUtils]: Spent 7.81 s on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-11-16 00:19:13,092 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-16 00:19:20,528 WARN L191 SmtUtils]: Spent 7.36 s on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-11-16 00:19:22,650 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-16 00:19:25,365 WARN L191 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-16 00:19:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:19:25,546 INFO L93 Difference]: Finished difference Result 3611 states and 4199 transitions. [2019-11-16 00:19:25,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-11-16 00:19:25,546 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 148 [2019-11-16 00:19:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:19:25,547 INFO L225 Difference]: With dead ends: 3611 [2019-11-16 00:19:25,547 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:19:25,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 148 SyntacticMatches, 8 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7355 ImplicationChecksByTransitivity, 524.2s TimeCoverageRelationStatistics Valid=1906, Invalid=23443, Unknown=91, NotChecked=0, Total=25440 [2019-11-16 00:19:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:19:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:19:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:19:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:19:25,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2019-11-16 00:19:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:19:25,549 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:19:25,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-16 00:19:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:19:25,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:19:25,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:19:25,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:19:25 BoogieIcfgContainer [2019-11-16 00:19:25,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:19:25,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:19:25,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:19:25,758 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:19:25,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:07:15" (3/4) ... [2019-11-16 00:19:25,761 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:19:25,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-16 00:19:25,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2019-11-16 00:19:25,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-16 00:19:25,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-16 00:19:25,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-16 00:19:25,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-16 00:19:25,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-16 00:19:25,767 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-16 00:19:25,774 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-16 00:19:25,774 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-16 00:19:25,775 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-16 00:19:25,818 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_112721ab-b921-434f-974a-88f97023d10f/bin/uautomizer/witness.graphml [2019-11-16 00:19:25,819 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:19:25,820 INFO L168 Benchmark]: Toolchain (without parser) took 731505.86 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 447.7 MB). Free memory was 944.8 MB in the beginning and 1.0 GB in the end (delta: -97.2 MB). Peak memory consumption was 350.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:25,820 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:19:25,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 721.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:25,821 INFO L168 Benchmark]: Boogie Preprocessor took 70.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:25,822 INFO L168 Benchmark]: RCFGBuilder took 850.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:25,822 INFO L168 Benchmark]: TraceAbstraction took 729797.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 309.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.7 MB). Peak memory consumption was 329.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:25,822 INFO L168 Benchmark]: Witness Printer took 61.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:25,824 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 721.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 850.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 729797.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 309.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.7 MB). Peak memory consumption was 329.6 MB. Max. memory is 11.5 GB. * Witness Printer took 61.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: 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: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: 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: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: 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: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 77 locations, 19 error locations. Result: SAFE, OverallTime: 729.7s, OverallIterations: 47, TraceHistogramMax: 9, AutomataDifference: 672.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2479 SDtfs, 10919 SDslu, 7581 SDs, 0 SdLazy, 54972 SolverSat, 1147 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 74.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3364 GetRequests, 1850 SyntacticMatches, 43 SemanticMatches, 1471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20932 ImplicationChecksByTransitivity, 629.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1685occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 47 MinimizatonAttempts, 3303 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 42.8s InterpolantComputationTime, 4543 NumberOfCodeBlocks, 4513 NumberOfCodeBlocksAsserted, 133 NumberOfCheckSat, 4467 ConstructedInterpolants, 495 QuantifiedInterpolants, 4876325 SizeOfPredicates, 308 NumberOfNonLiveVariables, 8105 ConjunctsInSsa, 1158 ConjunctsInUnsatCore, 76 InterpolantComputations, 18 PerfectInterpolantSequences, 2188/7411 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...