./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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 646417a8dd8807492175439f0c109786ec3887ae ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:57:08,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:57:08,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:57:08,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:57:08,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:57:08,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:57:08,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:57:08,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:57:08,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:57:08,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:57:08,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:57:08,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:57:08,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:57:08,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:57:08,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:57:08,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:57:08,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:57:08,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:57:08,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:57:08,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:57:08,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:57:08,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:57:08,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:57:08,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:57:08,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:57:08,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:57:08,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:57:08,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:57:08,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:57:08,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:57:08,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:57:08,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:57:08,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:57:08,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:57:08,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:57:08,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:57:08,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:57:08,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:57:08,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:57:08,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:57:08,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:57:08,745 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 17:57:08,757 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:57:08,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:57:08,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:57:08,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:57:08,759 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:57:08,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:57:08,760 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:57:08,760 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:57:08,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:57:08,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:57:08,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:57:08,760 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:57:08,761 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:57:08,761 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 17:57:08,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:57:08,761 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:57:08,761 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:57:08,761 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:57:08,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:57:08,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:57:08,762 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:57:08,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:57:08,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:57:08,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:57:08,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:57:08,763 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:57:08,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:57:08,763 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:57:08,763 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_f937ed04-6cce-4718-83bc-cda50ee78ec6/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 -> 646417a8dd8807492175439f0c109786ec3887ae [2019-12-07 17:57:08,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:57:08,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:57:08,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:57:08,878 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:57:08,879 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:57:08,879 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2019-12-07 17:57:08,925 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/bin/uautomizer/data/ece81458f/2e3e0a3e20994a12a4079bcd4d30afa9/FLAGc8c843a5a [2019-12-07 17:57:09,279 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:57:09,280 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2019-12-07 17:57:09,291 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/bin/uautomizer/data/ece81458f/2e3e0a3e20994a12a4079bcd4d30afa9/FLAGc8c843a5a [2019-12-07 17:57:09,299 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/bin/uautomizer/data/ece81458f/2e3e0a3e20994a12a4079bcd4d30afa9 [2019-12-07 17:57:09,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:57:09,302 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 17:57:09,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:57:09,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:57:09,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:57:09,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:57:09" (1/1) ... [2019-12-07 17:57:09,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eba8e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:09, skipping insertion in model container [2019-12-07 17:57:09,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:57:09" (1/1) ... [2019-12-07 17:57:09,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:57:09,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:57:09,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:57:09,543 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:57:09,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:57:09,603 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:57:09,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:09 WrapperNode [2019-12-07 17:57:09,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:57:09,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:57:09,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:57:09,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:57:09,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:09" (1/1) ... [2019-12-07 17:57:09,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:09" (1/1) ... [2019-12-07 17:57:09,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:09" (1/1) ... [2019-12-07 17:57:09,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:09" (1/1) ... [2019-12-07 17:57:09,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:09" (1/1) ... [2019-12-07 17:57:09,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:09" (1/1) ... [2019-12-07 17:57:09,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:09" (1/1) ... [2019-12-07 17:57:09,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:57:09,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:57:09,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:57:09,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:57:09,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 17:57:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:57:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 17:57:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 17:57:09,684 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 17:57:09,684 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 17:57:09,684 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 17:57:09,684 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2019-12-07 17:57:09,684 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 17:57:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 17:57:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 17:57:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 17:57:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 17:57:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 17:57:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 17:57:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 17:57:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 17:57:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 17:57:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 17:57:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 17:57:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 17:57:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 17:57:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 17:57:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 17:57:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 17:57:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 17:57:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 17:57:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 17:57:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 17:57:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 17:57:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 17:57:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 17:57:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 17:57:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 17:57:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 17:57:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 17:57:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 17:57:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 17:57:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 17:57:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 17:57:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 17:57:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 17:57:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 17:57:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 17:57:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 17:57:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 17:57:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 17:57:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 17:57:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 17:57:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 17:57:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 17:57:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 17:57:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 17:57:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 17:57:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 17:57:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 17:57:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 17:57:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 17:57:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 17:57:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 17:57:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 17:57:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 17:57:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 17:57:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 17:57:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 17:57:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 17:57:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 17:57:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 17:57:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 17:57:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 17:57:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 17:57:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 17:57:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 17:57:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 17:57:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 17:57:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 17:57:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 17:57:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 17:57:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 17:57:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 17:57:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 17:57:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 17:57:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 17:57:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:57:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:57:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 17:57:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:57:09,980 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:57:09,980 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 17:57:09,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:57:09 BoogieIcfgContainer [2019-12-07 17:57:09,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:57:09,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:57:09,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:57:09,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:57:09,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:57:09" (1/3) ... [2019-12-07 17:57:09,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb825b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:57:09, skipping insertion in model container [2019-12-07 17:57:09,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:09" (2/3) ... [2019-12-07 17:57:09,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb825b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:57:09, skipping insertion in model container [2019-12-07 17:57:09,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:57:09" (3/3) ... [2019-12-07 17:57:09,985 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca-1.i [2019-12-07 17:57:09,991 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:57:09,998 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 17:57:10,008 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 17:57:10,025 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:57:10,025 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 17:57:10,025 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:57:10,025 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:57:10,025 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:57:10,025 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:57:10,025 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:57:10,025 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:57:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-12-07 17:57:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:57:10,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:10,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:10,042 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:10,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:10,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1274980559, now seen corresponding path program 1 times [2019-12-07 17:57:10,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:10,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15088590] [2019-12-07 17:57:10,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:10,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15088590] [2019-12-07 17:57:10,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:10,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:57:10,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466598788] [2019-12-07 17:57:10,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:10,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:10,209 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2019-12-07 17:57:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:10,358 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2019-12-07 17:57:10,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:57:10,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 17:57:10,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:10,366 INFO L225 Difference]: With dead ends: 83 [2019-12-07 17:57:10,366 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 17:57:10,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:57:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 17:57:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2019-12-07 17:57:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 17:57:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-12-07 17:57:10,397 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 11 [2019-12-07 17:57:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:10,397 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-12-07 17:57:10,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-12-07 17:57:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:57:10,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:10,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:10,398 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1276827601, now seen corresponding path program 1 times [2019-12-07 17:57:10,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:10,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454089060] [2019-12-07 17:57:10,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:10,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454089060] [2019-12-07 17:57:10,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:10,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:10,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836616427] [2019-12-07 17:57:10,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:10,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:10,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:10,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:10,464 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 5 states. [2019-12-07 17:57:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:10,602 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-12-07 17:57:10,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:57:10,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 17:57:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:10,604 INFO L225 Difference]: With dead ends: 84 [2019-12-07 17:57:10,604 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 17:57:10,605 INFO L630 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-12-07 17:57:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 17:57:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2019-12-07 17:57:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 17:57:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-12-07 17:57:10,610 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 11 [2019-12-07 17:57:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:10,610 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-12-07 17:57:10,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-12-07 17:57:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:57:10,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:10,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:10,611 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:10,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:10,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1276827600, now seen corresponding path program 1 times [2019-12-07 17:57:10,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:10,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720083960] [2019-12-07 17:57:10,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:10,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720083960] [2019-12-07 17:57:10,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:10,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:10,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141953428] [2019-12-07 17:57:10,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:10,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:10,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:10,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:10,646 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 4 states. [2019-12-07 17:57:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:10,726 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2019-12-07 17:57:10,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:10,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:57:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:10,727 INFO L225 Difference]: With dead ends: 62 [2019-12-07 17:57:10,727 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 17:57:10,727 INFO L630 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-12-07 17:57:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 17:57:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 17:57:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 17:57:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2019-12-07 17:57:10,732 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 11 [2019-12-07 17:57:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:10,732 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2019-12-07 17:57:10,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2019-12-07 17:57:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:57:10,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:10,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:10,733 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1190586438, now seen corresponding path program 1 times [2019-12-07 17:57:10,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:10,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137230533] [2019-12-07 17:57:10,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:10,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137230533] [2019-12-07 17:57:10,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:10,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:10,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837984672] [2019-12-07 17:57:10,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:10,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:10,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:10,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:10,778 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 5 states. [2019-12-07 17:57:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:10,857 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2019-12-07 17:57:10,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:57:10,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 17:57:10,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:10,858 INFO L225 Difference]: With dead ends: 61 [2019-12-07 17:57:10,858 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 17:57:10,858 INFO L630 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-12-07 17:57:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 17:57:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-07 17:57:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 17:57:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-12-07 17:57:10,862 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 13 [2019-12-07 17:57:10,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:10,863 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-12-07 17:57:10,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-12-07 17:57:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:57:10,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:10,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:10,864 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:10,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:10,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1190586490, now seen corresponding path program 1 times [2019-12-07 17:57:10,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:10,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16108503] [2019-12-07 17:57:10,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:10,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16108503] [2019-12-07 17:57:10,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:10,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:10,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968167356] [2019-12-07 17:57:10,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:10,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:10,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:10,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:10,895 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 4 states. [2019-12-07 17:57:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:10,969 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-12-07 17:57:10,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:10,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:57:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:10,971 INFO L225 Difference]: With dead ends: 59 [2019-12-07 17:57:10,971 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 17:57:10,971 INFO L630 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-12-07 17:57:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 17:57:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-12-07 17:57:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 17:57:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-12-07 17:57:10,975 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 13 [2019-12-07 17:57:10,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:10,975 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-12-07 17:57:10,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-12-07 17:57:10,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:57:10,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:10,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:10,976 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:10,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1190586491, now seen corresponding path program 1 times [2019-12-07 17:57:10,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:10,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432914627] [2019-12-07 17:57:10,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:11,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432914627] [2019-12-07 17:57:11,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:11,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:57:11,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012052718] [2019-12-07 17:57:11,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:11,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:11,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:11,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:11,011 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 5 states. [2019-12-07 17:57:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:11,092 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2019-12-07 17:57:11,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:57:11,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 17:57:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:11,093 INFO L225 Difference]: With dead ends: 78 [2019-12-07 17:57:11,093 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 17:57:11,093 INFO L630 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-12-07 17:57:11,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 17:57:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2019-12-07 17:57:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 17:57:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-12-07 17:57:11,097 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 13 [2019-12-07 17:57:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:11,098 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-12-07 17:57:11,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:11,098 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-12-07 17:57:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:57:11,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:11,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:11,099 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:11,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:11,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1247844793, now seen corresponding path program 1 times [2019-12-07 17:57:11,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:11,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493241480] [2019-12-07 17:57:11,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:11,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493241480] [2019-12-07 17:57:11,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:11,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:57:11,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534609365] [2019-12-07 17:57:11,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:57:11,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:11,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:57:11,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:57:11,150 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 6 states. [2019-12-07 17:57:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:11,251 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2019-12-07 17:57:11,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:57:11,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 17:57:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:11,253 INFO L225 Difference]: With dead ends: 81 [2019-12-07 17:57:11,253 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 17:57:11,253 INFO L630 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-12-07 17:57:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 17:57:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-12-07 17:57:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 17:57:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2019-12-07 17:57:11,257 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 13 [2019-12-07 17:57:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:11,257 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-12-07 17:57:11,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:57:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2019-12-07 17:57:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:57:11,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:11,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:11,258 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:11,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:11,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1746526086, now seen corresponding path program 1 times [2019-12-07 17:57:11,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:11,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927795273] [2019-12-07 17:57:11,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:11,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927795273] [2019-12-07 17:57:11,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:11,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:11,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509814480] [2019-12-07 17:57:11,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:11,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:11,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:11,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:11,292 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 5 states. [2019-12-07 17:57:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:11,351 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2019-12-07 17:57:11,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:57:11,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 17:57:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:11,352 INFO L225 Difference]: With dead ends: 71 [2019-12-07 17:57:11,352 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 17:57:11,352 INFO L630 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-12-07 17:57:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 17:57:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-12-07 17:57:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 17:57:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-12-07 17:57:11,356 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 14 [2019-12-07 17:57:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:11,356 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-12-07 17:57:11,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-12-07 17:57:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:57:11,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:11,357 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:11,358 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:11,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:11,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1874075756, now seen corresponding path program 1 times [2019-12-07 17:57:11,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:11,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904930853] [2019-12-07 17:57:11,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:11,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904930853] [2019-12-07 17:57:11,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353913755] [2019-12-07 17:57:11,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:11,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:57:11,481 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:11,508 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-12-07 17:57:11,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,520 INFO L377 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-12-07 17:57:11,521 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,529 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,536 INFO L377 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-12-07 17:57:11,537 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,543 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,544 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 17:57:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:11,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:11,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-12-07 17:57:11,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958863592] [2019-12-07 17:57:11,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:57:11,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:11,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:57:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:57:11,554 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 7 states. [2019-12-07 17:57:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:11,691 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2019-12-07 17:57:11,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:57:11,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 17:57:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:11,692 INFO L225 Difference]: With dead ends: 90 [2019-12-07 17:57:11,692 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 17:57:11,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:57:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 17:57:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-12-07 17:57:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 17:57:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2019-12-07 17:57:11,695 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 15 [2019-12-07 17:57:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:11,695 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2019-12-07 17:57:11,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:57:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2019-12-07 17:57:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:57:11,696 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:11,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:11,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:11,897 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1524736657, now seen corresponding path program 1 times [2019-12-07 17:57:11,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:11,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085418180] [2019-12-07 17:57:11,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:11,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085418180] [2019-12-07 17:57:11,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:11,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:57:11,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93972956] [2019-12-07 17:57:11,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:57:11,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:11,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:57:11,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:57:11,938 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 6 states. [2019-12-07 17:57:12,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:12,028 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-12-07 17:57:12,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:57:12,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-07 17:57:12,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:12,029 INFO L225 Difference]: With dead ends: 64 [2019-12-07 17:57:12,029 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 17:57:12,030 INFO L630 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-12-07 17:57:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 17:57:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 17:57:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 17:57:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-12-07 17:57:12,032 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 17 [2019-12-07 17:57:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:12,032 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-12-07 17:57:12,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:57:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-12-07 17:57:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:57:12,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:12,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:12,033 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:12,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1524736656, now seen corresponding path program 1 times [2019-12-07 17:57:12,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:12,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566369759] [2019-12-07 17:57:12,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:12,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566369759] [2019-12-07 17:57:12,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:12,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:57:12,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145761354] [2019-12-07 17:57:12,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:57:12,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:12,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:57:12,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:57:12,089 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 8 states. [2019-12-07 17:57:12,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:12,232 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2019-12-07 17:57:12,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:57:12,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 17:57:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:12,234 INFO L225 Difference]: With dead ends: 86 [2019-12-07 17:57:12,234 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 17:57:12,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:57:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 17:57:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-12-07 17:57:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 17:57:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2019-12-07 17:57:12,237 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 17 [2019-12-07 17:57:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:12,237 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2019-12-07 17:57:12,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:57:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2019-12-07 17:57:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:57:12,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:12,238 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:12,238 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:12,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:12,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1869159940, now seen corresponding path program 1 times [2019-12-07 17:57:12,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:12,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346404290] [2019-12-07 17:57:12,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:12,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346404290] [2019-12-07 17:57:12,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502109909] [2019-12-07 17:57:12,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:12,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 17:57:12,346 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:12,358 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:12,359 INFO L377 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-12-07 17:57:12,359 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:12,378 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 17:57:12,378 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:12,378 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 17:57:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:12,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:12,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-12-07 17:57:12,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429902754] [2019-12-07 17:57:12,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:57:12,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:12,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:57:12,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:57:12,389 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2019-12-07 17:57:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:12,488 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-12-07 17:57:12,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:57:12,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 17:57:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:12,489 INFO L225 Difference]: With dead ends: 74 [2019-12-07 17:57:12,489 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 17:57:12,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:57:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 17:57:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2019-12-07 17:57:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 17:57:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-12-07 17:57:12,492 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 17 [2019-12-07 17:57:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:12,492 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-12-07 17:57:12,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:57:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-12-07 17:57:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:57:12,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:12,492 INFO L410 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-12-07 17:57:12,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:12,693 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash 182222645, now seen corresponding path program 1 times [2019-12-07 17:57:12,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:12,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098899098] [2019-12-07 17:57:12,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:12,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098899098] [2019-12-07 17:57:12,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:12,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:57:12,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450464562] [2019-12-07 17:57:12,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:57:12,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:12,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:57:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:57:12,753 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 7 states. [2019-12-07 17:57:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:12,875 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-12-07 17:57:12,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:57:12,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-07 17:57:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:12,876 INFO L225 Difference]: With dead ends: 64 [2019-12-07 17:57:12,876 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 17:57:12,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:57:12,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 17:57:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-12-07 17:57:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 17:57:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-12-07 17:57:12,879 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 21 [2019-12-07 17:57:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:12,879 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-12-07 17:57:12,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:57:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2019-12-07 17:57:12,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:57:12,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:12,879 INFO L410 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-12-07 17:57:12,880 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:12,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:12,880 INFO L82 PathProgramCache]: Analyzing trace with hash 182222646, now seen corresponding path program 1 times [2019-12-07 17:57:12,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:12,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198045949] [2019-12-07 17:57:12,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:12,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198045949] [2019-12-07 17:57:12,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:12,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:57:12,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202725581] [2019-12-07 17:57:12,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:57:12,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:12,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:57:12,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:57:12,939 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 9 states. [2019-12-07 17:57:13,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:13,103 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2019-12-07 17:57:13,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:57:13,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-07 17:57:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:13,104 INFO L225 Difference]: With dead ends: 76 [2019-12-07 17:57:13,104 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 17:57:13,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:57:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 17:57:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2019-12-07 17:57:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 17:57:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-12-07 17:57:13,106 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 21 [2019-12-07 17:57:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:13,107 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-12-07 17:57:13,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:57:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-12-07 17:57:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:57:13,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:13,107 INFO L410 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-12-07 17:57:13,107 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:13,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:13,108 INFO L82 PathProgramCache]: Analyzing trace with hash -994936542, now seen corresponding path program 1 times [2019-12-07 17:57:13,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:13,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848698653] [2019-12-07 17:57:13,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:13,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848698653] [2019-12-07 17:57:13,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:13,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:13,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499772820] [2019-12-07 17:57:13,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:13,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:13,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:13,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:13,158 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 5 states. [2019-12-07 17:57:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:13,207 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-12-07 17:57:13,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:13,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 17:57:13,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:13,208 INFO L225 Difference]: With dead ends: 67 [2019-12-07 17:57:13,208 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 17:57:13,208 INFO L630 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-12-07 17:57:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 17:57:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 17:57:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 17:57:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-12-07 17:57:13,209 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 23 [2019-12-07 17:57:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:13,210 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-12-07 17:57:13,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-12-07 17:57:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:57:13,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:13,210 INFO L410 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-12-07 17:57:13,210 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:13,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:13,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1032720461, now seen corresponding path program 1 times [2019-12-07 17:57:13,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:13,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133472393] [2019-12-07 17:57:13,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:13,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133472393] [2019-12-07 17:57:13,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:13,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:13,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164905340] [2019-12-07 17:57:13,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:13,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:13,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:13,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:13,230 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 4 states. [2019-12-07 17:57:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:13,271 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-12-07 17:57:13,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:13,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 17:57:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:13,271 INFO L225 Difference]: With dead ends: 64 [2019-12-07 17:57:13,271 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 17:57:13,272 INFO L630 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-12-07 17:57:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 17:57:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-07 17:57:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 17:57:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2019-12-07 17:57:13,273 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 25 [2019-12-07 17:57:13,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:13,273 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2019-12-07 17:57:13,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2019-12-07 17:57:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:57:13,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:13,274 INFO L410 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-12-07 17:57:13,274 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:13,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:13,275 INFO L82 PathProgramCache]: Analyzing trace with hash 301059978, now seen corresponding path program 1 times [2019-12-07 17:57:13,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:13,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960151690] [2019-12-07 17:57:13,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:13,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960151690] [2019-12-07 17:57:13,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:13,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:57:13,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070989846] [2019-12-07 17:57:13,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:57:13,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:13,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:57:13,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:57:13,361 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 9 states. [2019-12-07 17:57:13,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:13,505 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2019-12-07 17:57:13,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:57:13,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-12-07 17:57:13,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:13,506 INFO L225 Difference]: With dead ends: 77 [2019-12-07 17:57:13,506 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 17:57:13,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:57:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 17:57:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-12-07 17:57:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 17:57:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-12-07 17:57:13,508 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 27 [2019-12-07 17:57:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:13,508 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-12-07 17:57:13,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:57:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-12-07 17:57:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:57:13,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:13,508 INFO L410 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-12-07 17:57:13,508 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:13,509 INFO L82 PathProgramCache]: Analyzing trace with hash 723761804, now seen corresponding path program 1 times [2019-12-07 17:57:13,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:13,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357385177] [2019-12-07 17:57:13,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:13,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357385177] [2019-12-07 17:57:13,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:13,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:57:13,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151735717] [2019-12-07 17:57:13,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:57:13,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:13,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:57:13,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:57:13,617 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 10 states. [2019-12-07 17:57:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:13,780 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2019-12-07 17:57:13,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:57:13,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-12-07 17:57:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:13,781 INFO L225 Difference]: With dead ends: 80 [2019-12-07 17:57:13,781 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 17:57:13,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:57:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 17:57:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2019-12-07 17:57:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 17:57:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-12-07 17:57:13,784 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 27 [2019-12-07 17:57:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:13,784 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-12-07 17:57:13,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:57:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2019-12-07 17:57:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:57:13,785 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:13,785 INFO L410 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] [2019-12-07 17:57:13,785 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:13,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:13,786 INFO L82 PathProgramCache]: Analyzing trace with hash 63626319, now seen corresponding path program 1 times [2019-12-07 17:57:13,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:13,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228720727] [2019-12-07 17:57:13,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:13,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228720727] [2019-12-07 17:57:13,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:13,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:57:13,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878044776] [2019-12-07 17:57:13,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:57:13,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:13,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:57:13,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:57:13,896 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 11 states. [2019-12-07 17:57:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:14,123 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2019-12-07 17:57:14,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:57:14,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-12-07 17:57:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:14,124 INFO L225 Difference]: With dead ends: 81 [2019-12-07 17:57:14,124 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 17:57:14,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:57:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 17:57:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-12-07 17:57:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 17:57:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-12-07 17:57:14,127 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 31 [2019-12-07 17:57:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:14,127 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-12-07 17:57:14,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:57:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-12-07 17:57:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:57:14,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:14,127 INFO L410 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] [2019-12-07 17:57:14,127 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:14,128 INFO L82 PathProgramCache]: Analyzing trace with hash -70387187, now seen corresponding path program 1 times [2019-12-07 17:57:14,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:14,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103530221] [2019-12-07 17:57:14,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:14,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103530221] [2019-12-07 17:57:14,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:14,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 17:57:14,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252202102] [2019-12-07 17:57:14,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:57:14,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:14,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:57:14,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:57:14,242 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 13 states. [2019-12-07 17:57:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:14,480 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2019-12-07 17:57:14,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:57:14,480 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-12-07 17:57:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:14,480 INFO L225 Difference]: With dead ends: 103 [2019-12-07 17:57:14,481 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 17:57:14,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:57:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 17:57:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2019-12-07 17:57:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 17:57:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2019-12-07 17:57:14,483 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 31 [2019-12-07 17:57:14,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:14,483 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2019-12-07 17:57:14,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:57:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2019-12-07 17:57:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 17:57:14,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:14,483 INFO L410 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-12-07 17:57:14,484 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:14,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:14,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2142096765, now seen corresponding path program 1 times [2019-12-07 17:57:14,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:14,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471488870] [2019-12-07 17:57:14,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:14,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471488870] [2019-12-07 17:57:14,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:14,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:57:14,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876925911] [2019-12-07 17:57:14,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:57:14,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:14,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:57:14,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:57:14,545 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 11 states. [2019-12-07 17:57:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:14,772 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-12-07 17:57:14,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:57:14,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-12-07 17:57:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:14,772 INFO L225 Difference]: With dead ends: 81 [2019-12-07 17:57:14,773 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 17:57:14,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:57:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 17:57:14,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-12-07 17:57:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 17:57:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2019-12-07 17:57:14,774 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 32 [2019-12-07 17:57:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:14,774 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2019-12-07 17:57:14,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:57:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2019-12-07 17:57:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:57:14,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:14,775 INFO L410 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-12-07 17:57:14,775 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:14,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:14,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1176807056, now seen corresponding path program 1 times [2019-12-07 17:57:14,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:14,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786746141] [2019-12-07 17:57:14,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:14,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786746141] [2019-12-07 17:57:14,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736871972] [2019-12-07 17:57:14,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:14,924 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 17:57:14,926 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:14,937 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:14,937 INFO L377 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-12-07 17:57:14,937 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:14,948 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 17:57:14,948 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:14,948 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 17:57:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:15,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:15,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-12-07 17:57:15,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431280226] [2019-12-07 17:57:15,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:57:15,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:15,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:57:15,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:57:15,032 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 18 states. [2019-12-07 17:57:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:15,319 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-12-07 17:57:15,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:57:15,320 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-12-07 17:57:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:15,320 INFO L225 Difference]: With dead ends: 73 [2019-12-07 17:57:15,320 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 17:57:15,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:57:15,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 17:57:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2019-12-07 17:57:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 17:57:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-12-07 17:57:15,322 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 35 [2019-12-07 17:57:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:15,322 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-12-07 17:57:15,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:57:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-12-07 17:57:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 17:57:15,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:15,323 INFO L410 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, 1, 1, 1] [2019-12-07 17:57:15,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:15,524 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:15,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:15,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1560164987, now seen corresponding path program 1 times [2019-12-07 17:57:15,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:15,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713468979] [2019-12-07 17:57:15,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:15,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713468979] [2019-12-07 17:57:15,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169684120] [2019-12-07 17:57:15,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:15,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 17:57:15,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:15,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:15,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-12-07 17:57:15,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384319407] [2019-12-07 17:57:15,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:57:15,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:15,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:57:15,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:57:15,751 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 16 states. [2019-12-07 17:57:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:15,971 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2019-12-07 17:57:15,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:57:15,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-12-07 17:57:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:15,972 INFO L225 Difference]: With dead ends: 119 [2019-12-07 17:57:15,972 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 17:57:15,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:57:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 17:57:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2019-12-07 17:57:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 17:57:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-12-07 17:57:15,974 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 38 [2019-12-07 17:57:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:15,974 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-12-07 17:57:15,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:57:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-12-07 17:57:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:57:15,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:15,975 INFO L410 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-12-07 17:57:16,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:16,176 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:16,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1664191332, now seen corresponding path program 2 times [2019-12-07 17:57:16,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:16,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930618781] [2019-12-07 17:57:16,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:16,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930618781] [2019-12-07 17:57:16,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643366143] [2019-12-07 17:57:16,391 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:16,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:57:16,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:57:16,454 INFO L264 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 17:57:16,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:16,466 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:16,466 INFO L377 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-12-07 17:57:16,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:16,477 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 17:57:16,477 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:16,477 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 17:57:16,527 INFO L377 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-12-07 17:57:16,528 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:16,532 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:16,532 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:16,532 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 17:57:16,624 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:16,624 INFO L377 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-12-07 17:57:16,624 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 17:57:16,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:16,630 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:16,630 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-12-07 17:57:16,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:16,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:16,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:16,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2019-12-07 17:57:16,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708431210] [2019-12-07 17:57:16,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 17:57:16,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:16,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 17:57:16,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:57:16,729 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 27 states. [2019-12-07 17:57:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:17,867 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2019-12-07 17:57:17,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 17:57:17,867 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2019-12-07 17:57:17,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:17,869 INFO L225 Difference]: With dead ends: 179 [2019-12-07 17:57:17,869 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 17:57:17,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=285, Invalid=1971, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 17:57:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 17:57:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2019-12-07 17:57:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 17:57:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2019-12-07 17:57:17,873 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 41 [2019-12-07 17:57:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:17,873 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2019-12-07 17:57:17,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 17:57:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2019-12-07 17:57:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:57:17,873 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:17,873 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:18,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:18,074 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:18,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash -959683498, now seen corresponding path program 2 times [2019-12-07 17:57:18,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:18,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7194261] [2019-12-07 17:57:18,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:18,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7194261] [2019-12-07 17:57:18,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406691943] [2019-12-07 17:57:18,303 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:18,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:57:18,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:57:18,379 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-07 17:57:18,382 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:18,388 INFO L377 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-12-07 17:57:18,388 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:18,392 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:18,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:18,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-12-07 17:57:18,424 INFO L377 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-12-07 17:57:18,425 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:18,431 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:18,432 INFO L534 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-12-07 17:57:18,432 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2019-12-07 17:57:18,460 INFO L377 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-12-07 17:57:18,460 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:18,469 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:18,470 INFO L534 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-12-07 17:57:18,470 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2019-12-07 17:57:19,015 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:19,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 38 [2019-12-07 17:57:19,015 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:19,037 INFO L614 ElimStorePlain]: treesize reduction 4, result has 91.1 percent of original size [2019-12-07 17:57:19,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:19,039 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:19,039 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:35 [2019-12-07 17:57:19,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:19,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:19,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 29 [2019-12-07 17:57:19,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394763115] [2019-12-07 17:57:19,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 17:57:19,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:19,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 17:57:19,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:57:19,155 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand 29 states. [2019-12-07 17:57:19,906 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-07 17:57:20,201 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-12-07 17:57:20,548 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-12-07 17:57:20,958 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 17:57:21,633 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-12-07 17:57:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:29,095 INFO L93 Difference]: Finished difference Result 326 states and 356 transitions. [2019-12-07 17:57:29,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 17:57:29,096 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2019-12-07 17:57:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:29,097 INFO L225 Difference]: With dead ends: 326 [2019-12-07 17:57:29,097 INFO L226 Difference]: Without dead ends: 297 [2019-12-07 17:57:29,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=532, Invalid=4156, Unknown=4, NotChecked=0, Total=4692 [2019-12-07 17:57:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-12-07 17:57:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 207. [2019-12-07 17:57:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-07 17:57:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 232 transitions. [2019-12-07 17:57:29,103 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 232 transitions. Word has length 51 [2019-12-07 17:57:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:29,103 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 232 transitions. [2019-12-07 17:57:29,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 17:57:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 232 transitions. [2019-12-07 17:57:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:57:29,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:29,104 INFO L410 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-12-07 17:57:29,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:29,306 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:29,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1458059333, now seen corresponding path program 3 times [2019-12-07 17:57:29,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:29,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882598166] [2019-12-07 17:57:29,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:29,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882598166] [2019-12-07 17:57:29,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964932904] [2019-12-07 17:57:29,835 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:29,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 17:57:29,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:57:29,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 17:57:29,911 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:30,001 INFO L377 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-12-07 17:57:30,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:30,005 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:30,005 INFO L534 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-12-07 17:57:30,005 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 17:57:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:30,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:30,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 33 [2019-12-07 17:57:30,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610959714] [2019-12-07 17:57:30,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 17:57:30,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:30,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 17:57:30,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 17:57:30,206 INFO L87 Difference]: Start difference. First operand 207 states and 232 transitions. Second operand 33 states. [2019-12-07 17:57:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:31,745 INFO L93 Difference]: Finished difference Result 324 states and 353 transitions. [2019-12-07 17:57:31,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 17:57:31,745 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 51 [2019-12-07 17:57:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:31,747 INFO L225 Difference]: With dead ends: 324 [2019-12-07 17:57:31,747 INFO L226 Difference]: Without dead ends: 295 [2019-12-07 17:57:31,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=333, Invalid=2859, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 17:57:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-07 17:57:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 273. [2019-12-07 17:57:31,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-12-07 17:57:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 304 transitions. [2019-12-07 17:57:31,754 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 304 transitions. Word has length 51 [2019-12-07 17:57:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:31,754 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 304 transitions. [2019-12-07 17:57:31,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 17:57:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 304 transitions. [2019-12-07 17:57:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:57:31,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:31,754 INFO L410 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-12-07 17:57:31,955 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:31,955 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:31,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:31,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1549396802, now seen corresponding path program 4 times [2019-12-07 17:57:31,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:31,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041170291] [2019-12-07 17:57:31,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:32,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041170291] [2019-12-07 17:57:32,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735657613] [2019-12-07 17:57:32,109 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:32,170 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:57:32,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:57:32,171 INFO L264 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 17:57:32,173 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:32,182 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:32,183 INFO L377 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-12-07 17:57:32,183 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:32,193 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 17:57:32,193 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:32,194 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 17:57:32,214 INFO L377 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-12-07 17:57:32,214 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:32,218 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:32,218 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:32,218 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 17:57:32,367 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:32,367 INFO L377 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-12-07 17:57:32,367 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 17:57:32,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:32,375 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:32,375 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-12-07 17:57:32,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:32,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:32,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:32,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 26 [2019-12-07 17:57:32,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287561283] [2019-12-07 17:57:32,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 17:57:32,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 17:57:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:57:32,500 INFO L87 Difference]: Start difference. First operand 273 states and 304 transitions. Second operand 27 states. [2019-12-07 17:57:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:33,826 INFO L93 Difference]: Finished difference Result 350 states and 382 transitions. [2019-12-07 17:57:33,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 17:57:33,826 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2019-12-07 17:57:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:33,827 INFO L225 Difference]: With dead ends: 350 [2019-12-07 17:57:33,827 INFO L226 Difference]: Without dead ends: 348 [2019-12-07 17:57:33,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=226, Invalid=1580, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 17:57:33,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-07 17:57:33,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 291. [2019-12-07 17:57:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 17:57:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 324 transitions. [2019-12-07 17:57:33,833 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 324 transitions. Word has length 55 [2019-12-07 17:57:33,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:33,833 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 324 transitions. [2019-12-07 17:57:33,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 17:57:33,834 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 324 transitions. [2019-12-07 17:57:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 17:57:33,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:33,834 INFO L410 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-12-07 17:57:34,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:34,035 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:34,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1254563602, now seen corresponding path program 5 times [2019-12-07 17:57:34,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:34,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91143190] [2019-12-07 17:57:34,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:34,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91143190] [2019-12-07 17:57:34,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603875743] [2019-12-07 17:57:34,202 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:34,266 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-07 17:57:34,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:57:34,267 INFO L264 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 17:57:34,269 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:34,346 INFO L377 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-12-07 17:57:34,346 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:34,351 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:34,351 INFO L534 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-12-07 17:57:34,351 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 17:57:34,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 17:57:34,463 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:34,464 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:34,464 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:34,465 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 17:57:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:34,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:34,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 29 [2019-12-07 17:57:34,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277436536] [2019-12-07 17:57:34,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 17:57:34,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:34,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 17:57:34,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:57:34,472 INFO L87 Difference]: Start difference. First operand 291 states and 324 transitions. Second operand 29 states. [2019-12-07 17:57:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:35,325 INFO L93 Difference]: Finished difference Result 434 states and 473 transitions. [2019-12-07 17:57:35,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 17:57:35,325 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 61 [2019-12-07 17:57:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:35,326 INFO L225 Difference]: With dead ends: 434 [2019-12-07 17:57:35,326 INFO L226 Difference]: Without dead ends: 399 [2019-12-07 17:57:35,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=1454, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 17:57:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-12-07 17:57:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 369. [2019-12-07 17:57:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-12-07 17:57:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 410 transitions. [2019-12-07 17:57:35,333 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 410 transitions. Word has length 61 [2019-12-07 17:57:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:35,333 INFO L462 AbstractCegarLoop]: Abstraction has 369 states and 410 transitions. [2019-12-07 17:57:35,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 17:57:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 410 transitions. [2019-12-07 17:57:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:57:35,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:35,334 INFO L410 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-12-07 17:57:35,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:35,535 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:35,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:35,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1950827605, now seen corresponding path program 6 times [2019-12-07 17:57:35,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:35,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222746219] [2019-12-07 17:57:35,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:35,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222746219] [2019-12-07 17:57:35,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724745987] [2019-12-07 17:57:35,727 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:35,814 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-07 17:57:35,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:57:35,815 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 17:57:35,817 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:35,828 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:35,829 INFO L377 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-12-07 17:57:35,829 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:35,843 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 17:57:35,843 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:35,843 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 17:57:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:36,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:36,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2019-12-07 17:57:36,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109479225] [2019-12-07 17:57:36,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 17:57:36,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:36,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 17:57:36,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2019-12-07 17:57:36,058 INFO L87 Difference]: Start difference. First operand 369 states and 410 transitions. Second operand 31 states. [2019-12-07 17:57:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:36,916 INFO L93 Difference]: Finished difference Result 444 states and 488 transitions. [2019-12-07 17:57:36,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:57:36,916 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 65 [2019-12-07 17:57:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:36,918 INFO L225 Difference]: With dead ends: 444 [2019-12-07 17:57:36,918 INFO L226 Difference]: Without dead ends: 442 [2019-12-07 17:57:36,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=1273, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 17:57:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-12-07 17:57:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 387. [2019-12-07 17:57:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-12-07 17:57:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 430 transitions. [2019-12-07 17:57:36,925 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 430 transitions. Word has length 65 [2019-12-07 17:57:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:36,925 INFO L462 AbstractCegarLoop]: Abstraction has 387 states and 430 transitions. [2019-12-07 17:57:36,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 17:57:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 430 transitions. [2019-12-07 17:57:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:57:36,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:36,926 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 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, 1] [2019-12-07 17:57:37,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:37,128 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:37,128 INFO L82 PathProgramCache]: Analyzing trace with hash -2109956344, now seen corresponding path program 1 times [2019-12-07 17:57:37,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:37,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732610761] [2019-12-07 17:57:37,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 17:57:37,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732610761] [2019-12-07 17:57:37,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270868730] [2019-12-07 17:57:37,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:37,338 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 17:57:37,339 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 17:57:37,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:37,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-12-07 17:57:37,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000376914] [2019-12-07 17:57:37,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 17:57:37,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:37,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 17:57:37,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:57:37,420 INFO L87 Difference]: Start difference. First operand 387 states and 430 transitions. Second operand 19 states. [2019-12-07 17:57:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:37,850 INFO L93 Difference]: Finished difference Result 563 states and 617 transitions. [2019-12-07 17:57:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:57:37,850 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2019-12-07 17:57:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:37,852 INFO L225 Difference]: With dead ends: 563 [2019-12-07 17:57:37,852 INFO L226 Difference]: Without dead ends: 563 [2019-12-07 17:57:37,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:57:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-12-07 17:57:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 436. [2019-12-07 17:57:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-07 17:57:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 489 transitions. [2019-12-07 17:57:37,859 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 489 transitions. Word has length 65 [2019-12-07 17:57:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:37,859 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 489 transitions. [2019-12-07 17:57:37,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 17:57:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 489 transitions. [2019-12-07 17:57:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 17:57:37,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:37,860 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2019-12-07 17:57:38,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:38,060 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 17:57:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash 694033474, now seen corresponding path program 3 times [2019-12-07 17:57:38,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:38,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842999474] [2019-12-07 17:57:38,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:38,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842999474] [2019-12-07 17:57:38,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207164024] [2019-12-07 17:57:38,657 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 17:57:38,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 17:57:38,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:57:38,734 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 17:57:38,735 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:38,739 INFO L377 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-12-07 17:57:38,740 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:38,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:38,742 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:38,742 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-12-07 17:57:38,873 INFO L377 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-12-07 17:57:38,874 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:38,878 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:38,878 INFO L534 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-12-07 17:57:38,879 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 17:57:38,916 INFO L377 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-12-07 17:57:38,917 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:38,923 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:38,924 INFO L534 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-12-07 17:57:38,924 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2019-12-07 17:57:39,577 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:39,578 INFO L377 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 43 treesize of output 70 [2019-12-07 17:57:39,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:39,607 INFO L614 ElimStorePlain]: treesize reduction 26, result has 61.8 percent of original size [2019-12-07 17:57:39,608 INFO L534 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:39,608 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:53, output treesize:8 [2019-12-07 17:57:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:57:39,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:39,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 45 [2019-12-07 17:57:39,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440928228] [2019-12-07 17:57:39,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-07 17:57:39,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:39,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-07 17:57:39,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1874, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 17:57:39,670 INFO L87 Difference]: Start difference. First operand 436 states and 489 transitions. Second operand 45 states. [2019-12-07 17:57:43,827 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-12-07 17:57:47,942 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-12-07 17:57:52,079 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-12-07 17:57:56,201 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-12-07 17:57:59,788 WARN L192 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-12-07 17:58:04,085 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-12-07 17:58:07,617 WARN L192 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-12-07 17:58:11,738 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-07 17:58:15,865 WARN L192 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-12-07 17:58:25,700 WARN L192 SmtUtils]: Spent 9.27 s on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-12-07 17:58:30,409 WARN L192 SmtUtils]: Spent 4.61 s on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-12-07 17:58:39,091 WARN L192 SmtUtils]: Spent 8.59 s on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-12-07 17:58:43,319 WARN L192 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-12-07 17:58:50,128 WARN L192 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-12-07 17:58:55,965 WARN L192 SmtUtils]: Spent 5.76 s on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-12-07 17:59:01,341 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-12-07 17:59:06,766 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-12-07 17:59:11,302 WARN L192 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-12-07 17:59:17,951 WARN L192 SmtUtils]: Spent 5.99 s on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-12-07 17:59:25,982 WARN L192 SmtUtils]: Spent 6.04 s on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-12-07 17:59:30,703 WARN L192 SmtUtils]: Spent 4.50 s on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-12-07 17:59:39,577 WARN L192 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-12-07 17:59:45,779 WARN L192 SmtUtils]: Spent 4.78 s on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-12-07 17:59:52,086 WARN L192 SmtUtils]: Spent 4.86 s on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-07 18:00:04,955 WARN L192 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 18:00:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:05,492 INFO L93 Difference]: Finished difference Result 995 states and 1099 transitions. [2019-12-07 18:00:05,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 18:00:05,493 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 68 [2019-12-07 18:00:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:05,496 INFO L225 Difference]: With dead ends: 995 [2019-12-07 18:00:05,496 INFO L226 Difference]: Without dead ends: 897 [2019-12-07 18:00:05,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 140.6s TimeCoverageRelationStatistics Valid=626, Invalid=6855, Unknown=1, NotChecked=0, Total=7482 [2019-12-07 18:00:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-12-07 18:00:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 679. [2019-12-07 18:00:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-12-07 18:00:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 760 transitions. [2019-12-07 18:00:05,512 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 760 transitions. Word has length 68 [2019-12-07 18:00:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:05,512 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 760 transitions. [2019-12-07 18:00:05,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-07 18:00:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 760 transitions. [2019-12-07 18:00:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 18:00:05,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:05,514 INFO L410 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-12-07 18:00:05,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:00:05,715 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:00:05,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:05,715 INFO L82 PathProgramCache]: Analyzing trace with hash -682229399, now seen corresponding path program 7 times [2019-12-07 18:00:05,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:00:05,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988493559] [2019-12-07 18:00:05,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:00:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 17 proven. 76 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:00:05,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988493559] [2019-12-07 18:00:05,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915307501] [2019-12-07 18:00:05,949 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:00:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:06,027 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 18:00:06,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:06,132 INFO L377 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-12-07 18:00:06,132 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:06,136 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:06,136 INFO L534 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-12-07 18:00:06,136 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 18:00:06,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 18:00:06,257 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:06,258 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:06,258 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:06,258 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 18:00:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 17 proven. 76 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:00:06,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:00:06,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 32 [2019-12-07 18:00:06,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570531473] [2019-12-07 18:00:06,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 18:00:06,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:00:06,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 18:00:06,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-12-07 18:00:06,268 INFO L87 Difference]: Start difference. First operand 679 states and 760 transitions. Second operand 32 states. [2019-12-07 18:00:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:08,631 INFO L93 Difference]: Finished difference Result 1006 states and 1104 transitions. [2019-12-07 18:00:08,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:00:08,632 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-12-07 18:00:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:08,635 INFO L225 Difference]: With dead ends: 1006 [2019-12-07 18:00:08,635 INFO L226 Difference]: Without dead ends: 951 [2019-12-07 18:00:08,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=1776, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 18:00:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-12-07 18:00:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 867. [2019-12-07 18:00:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-12-07 18:00:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 966 transitions. [2019-12-07 18:00:08,652 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 966 transitions. Word has length 71 [2019-12-07 18:00:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:08,653 INFO L462 AbstractCegarLoop]: Abstraction has 867 states and 966 transitions. [2019-12-07 18:00:08,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 18:00:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 966 transitions. [2019-12-07 18:00:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 18:00:08,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:08,654 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2019-12-07 18:00:08,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:00:08,855 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:00:08,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:08,855 INFO L82 PathProgramCache]: Analyzing trace with hash -853851937, now seen corresponding path program 4 times [2019-12-07 18:00:08,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:00:08,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750380320] [2019-12-07 18:00:08,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:00:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:00:08,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750380320] [2019-12-07 18:00:08,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819421757] [2019-12-07 18:00:08,988 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:00:09,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:00:09,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:00:09,057 INFO L264 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 64 conjunts are in the unsatisfiable core [2019-12-07 18:00:09,058 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:09,060 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_36|]} [2019-12-07 18:00:09,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:00:09,064 INFO L377 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-12-07 18:00:09,064 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:09,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:09,074 INFO L377 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-12-07 18:00:09,074 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:09,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:09,082 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:09,082 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2019-12-07 18:00:09,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-12-07 18:00:09,161 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:09,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:09,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:09,168 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 18:00:09,193 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-12-07 18:00:09,193 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:09,200 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:09,200 INFO L534 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-12-07 18:00:09,201 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-12-07 18:00:11,461 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 18:00:11,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:11,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 42 [2019-12-07 18:00:11,714 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:11,736 INFO L614 ElimStorePlain]: treesize reduction 4, result has 91.1 percent of original size [2019-12-07 18:00:11,736 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:11,736 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:28 [2019-12-07 18:00:11,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:00:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:00:11,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:00:11,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22] total 34 [2019-12-07 18:00:11,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712539573] [2019-12-07 18:00:11,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 18:00:11,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:00:11,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 18:00:11,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 18:00:11,867 INFO L87 Difference]: Start difference. First operand 867 states and 966 transitions. Second operand 35 states. [2019-12-07 18:00:17,244 WARN L192 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-12-07 18:00:21,396 WARN L192 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-12-07 18:00:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:25,584 INFO L93 Difference]: Finished difference Result 1437 states and 1579 transitions. [2019-12-07 18:00:25,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 18:00:25,586 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2019-12-07 18:00:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:25,600 INFO L225 Difference]: With dead ends: 1437 [2019-12-07 18:00:25,600 INFO L226 Difference]: Without dead ends: 1437 [2019-12-07 18:00:25,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=645, Invalid=4905, Unknown=0, NotChecked=0, Total=5550 [2019-12-07 18:00:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2019-12-07 18:00:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 999. [2019-12-07 18:00:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2019-12-07 18:00:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1114 transitions. [2019-12-07 18:00:25,623 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1114 transitions. Word has length 72 [2019-12-07 18:00:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:25,624 INFO L462 AbstractCegarLoop]: Abstraction has 999 states and 1114 transitions. [2019-12-07 18:00:25,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 18:00:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1114 transitions. [2019-12-07 18:00:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 18:00:25,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:25,625 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:25,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:00:25,826 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:00:25,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:25,826 INFO L82 PathProgramCache]: Analyzing trace with hash 646360812, now seen corresponding path program 8 times [2019-12-07 18:00:25,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:00:25,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291468509] [2019-12-07 18:00:25,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:00:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 30 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:00:26,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291468509] [2019-12-07 18:00:26,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965100278] [2019-12-07 18:00:26,054 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:00:26,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:00:26,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:00:26,128 INFO L264 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 18:00:26,129 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:26,139 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:26,140 INFO L377 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-12-07 18:00:26,140 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:26,152 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 18:00:26,152 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:26,152 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:00:26,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:00:26,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 23 [2019-12-07 18:00:26,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195747595] [2019-12-07 18:00:26,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 18:00:26,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:00:26,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 18:00:26,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:00:26,252 INFO L87 Difference]: Start difference. First operand 999 states and 1114 transitions. Second operand 24 states. [2019-12-07 18:00:27,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:27,349 INFO L93 Difference]: Finished difference Result 1222 states and 1348 transitions. [2019-12-07 18:00:27,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:00:27,351 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2019-12-07 18:00:27,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:27,362 INFO L225 Difference]: With dead ends: 1222 [2019-12-07 18:00:27,362 INFO L226 Difference]: Without dead ends: 1220 [2019-12-07 18:00:27,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 18:00:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2019-12-07 18:00:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1041. [2019-12-07 18:00:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2019-12-07 18:00:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1162 transitions. [2019-12-07 18:00:27,390 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1162 transitions. Word has length 75 [2019-12-07 18:00:27,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:27,390 INFO L462 AbstractCegarLoop]: Abstraction has 1041 states and 1162 transitions. [2019-12-07 18:00:27,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 18:00:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1162 transitions. [2019-12-07 18:00:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 18:00:27,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:27,392 INFO L410 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-12-07 18:00:27,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:00:27,594 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:00:27,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:27,594 INFO L82 PathProgramCache]: Analyzing trace with hash 648732352, now seen corresponding path program 9 times [2019-12-07 18:00:27,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:00:27,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074422334] [2019-12-07 18:00:27,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:00:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:00:27,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074422334] [2019-12-07 18:00:27,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044764152] [2019-12-07 18:00:27,897 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:00:28,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-12-07 18:00:28,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:00:28,005 INFO L264 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 18:00:28,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:28,129 INFO L377 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-12-07 18:00:28,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:28,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:28,133 INFO L534 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-12-07 18:00:28,134 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 18:00:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:00:28,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:00:28,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 37 [2019-12-07 18:00:28,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170830819] [2019-12-07 18:00:28,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 18:00:28,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:00:28,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 18:00:28,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 18:00:28,336 INFO L87 Difference]: Start difference. First operand 1041 states and 1162 transitions. Second operand 37 states. [2019-12-07 18:00:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:31,699 INFO L93 Difference]: Finished difference Result 1490 states and 1637 transitions. [2019-12-07 18:00:31,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 18:00:31,700 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2019-12-07 18:00:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:31,711 INFO L225 Difference]: With dead ends: 1490 [2019-12-07 18:00:31,711 INFO L226 Difference]: Without dead ends: 1426 [2019-12-07 18:00:31,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=233, Invalid=2317, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 18:00:31,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2019-12-07 18:00:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1296. [2019-12-07 18:00:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296 states. [2019-12-07 18:00:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1444 transitions. [2019-12-07 18:00:31,737 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1444 transitions. Word has length 81 [2019-12-07 18:00:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:31,737 INFO L462 AbstractCegarLoop]: Abstraction has 1296 states and 1444 transitions. [2019-12-07 18:00:31,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 18:00:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1444 transitions. [2019-12-07 18:00:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 18:00:31,739 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:31,739 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-07 18:00:31,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:00:31,940 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:00:31,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:31,941 INFO L82 PathProgramCache]: Analyzing trace with hash 945453023, now seen corresponding path program 2 times [2019-12-07 18:00:31,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:00:31,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097981618] [2019-12-07 18:00:31,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:00:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 49 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 18:00:32,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097981618] [2019-12-07 18:00:32,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505642571] [2019-12-07 18:00:32,156 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:00:32,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:00:32,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:00:32,240 INFO L264 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 18:00:32,241 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:32,245 INFO L377 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-12-07 18:00:32,245 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:32,247 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:32,247 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:32,248 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-12-07 18:00:32,316 INFO L377 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-12-07 18:00:32,316 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:32,320 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:32,321 INFO L534 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-12-07 18:00:32,321 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 18:00:32,343 INFO L377 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-12-07 18:00:32,344 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:32,349 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:32,350 INFO L534 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-12-07 18:00:32,350 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2019-12-07 18:00:32,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:32,823 INFO L377 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 43 treesize of output 70 [2019-12-07 18:00:32,824 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:32,851 INFO L614 ElimStorePlain]: treesize reduction 26, result has 61.8 percent of original size [2019-12-07 18:00:32,852 INFO L534 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:32,852 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:53, output treesize:8 [2019-12-07 18:00:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 10 proven. 73 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 18:00:32,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:00:32,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2019-12-07 18:00:32,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177027384] [2019-12-07 18:00:32,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 18:00:32,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:00:32,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 18:00:32,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:00:32,915 INFO L87 Difference]: Start difference. First operand 1296 states and 1444 transitions. Second operand 31 states. [2019-12-07 18:00:36,789 WARN L192 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-12-07 18:00:41,067 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-12-07 18:00:45,171 WARN L192 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-12-07 18:00:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:45,352 INFO L93 Difference]: Finished difference Result 1271 states and 1407 transitions. [2019-12-07 18:00:45,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:00:45,352 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2019-12-07 18:00:45,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:45,355 INFO L225 Difference]: With dead ends: 1271 [2019-12-07 18:00:45,356 INFO L226 Difference]: Without dead ends: 1013 [2019-12-07 18:00:45,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=146, Invalid=1414, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 18:00:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-12-07 18:00:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 953. [2019-12-07 18:00:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-12-07 18:00:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1070 transitions. [2019-12-07 18:00:45,366 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1070 transitions. Word has length 84 [2019-12-07 18:00:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:45,366 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1070 transitions. [2019-12-07 18:00:45,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 18:00:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1070 transitions. [2019-12-07 18:00:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 18:00:45,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:45,367 INFO L410 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-12-07 18:00:45,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:00:45,568 INFO L410 AbstractCegarLoop]: === Iteration 37 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:00:45,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:45,568 INFO L82 PathProgramCache]: Analyzing trace with hash -139541373, now seen corresponding path program 10 times [2019-12-07 18:00:45,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:00:45,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457303304] [2019-12-07 18:00:45,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:00:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:45,832 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 47 proven. 115 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:00:45,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457303304] [2019-12-07 18:00:45,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533104754] [2019-12-07 18:00:45,832 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:00:45,900 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:00:45,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:00:45,902 INFO L264 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 18:00:45,903 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:45,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:45,913 INFO L377 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-12-07 18:00:45,913 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:45,924 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 18:00:45,924 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:45,924 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:45,949 INFO L377 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-12-07 18:00:45,949 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:45,953 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:45,953 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:45,954 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 18:00:46,213 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:46,213 INFO L377 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-12-07 18:00:46,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:00:46,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:46,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:46,220 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-12-07 18:00:46,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:00:46,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:00:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 50 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:00:46,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:00:46,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 35 [2019-12-07 18:00:46,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546345999] [2019-12-07 18:00:46,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 18:00:46,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:00:46,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 18:00:46,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:00:46,386 INFO L87 Difference]: Start difference. First operand 953 states and 1070 transitions. Second operand 36 states. [2019-12-07 18:00:48,701 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-12-07 18:00:49,630 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-07 18:00:50,564 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-12-07 18:00:52,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:52,197 INFO L93 Difference]: Finished difference Result 1256 states and 1380 transitions. [2019-12-07 18:00:52,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 18:00:52,198 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 85 [2019-12-07 18:00:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:52,208 INFO L225 Difference]: With dead ends: 1256 [2019-12-07 18:00:52,208 INFO L226 Difference]: Without dead ends: 1254 [2019-12-07 18:00:52,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=340, Invalid=2966, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 18:00:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2019-12-07 18:00:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 989. [2019-12-07 18:00:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-12-07 18:00:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1111 transitions. [2019-12-07 18:00:52,234 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1111 transitions. Word has length 85 [2019-12-07 18:00:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:52,235 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 1111 transitions. [2019-12-07 18:00:52,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 18:00:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1111 transitions. [2019-12-07 18:00:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 18:00:52,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:52,237 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1] [2019-12-07 18:00:52,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:00:52,437 INFO L410 AbstractCegarLoop]: === Iteration 38 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:00:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2060735684, now seen corresponding path program 5 times [2019-12-07 18:00:52,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:00:52,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904471855] [2019-12-07 18:00:52,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:00:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 7 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:00:52,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904471855] [2019-12-07 18:00:52,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999707245] [2019-12-07 18:00:52,847 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:00:52,918 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-07 18:00:52,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:00:52,920 INFO L264 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 84 conjunts are in the unsatisfiable core [2019-12-07 18:00:52,922 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:52,925 INFO L377 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-12-07 18:00:52,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:52,928 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:52,928 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:52,928 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 18:00:53,027 INFO L377 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-12-07 18:00:53,027 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:53,034 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:53,034 INFO L534 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-12-07 18:00:53,034 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-12-07 18:00:53,076 INFO L377 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-12-07 18:00:53,077 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:53,084 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:53,085 INFO L534 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-12-07 18:00:53,085 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-12-07 18:00:54,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:00:54,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:00:54,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:54,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 41 [2019-12-07 18:00:54,291 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:54,315 INFO L614 ElimStorePlain]: treesize reduction 4, result has 91.7 percent of original size [2019-12-07 18:00:54,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:00:54,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:54,317 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:35 [2019-12-07 18:00:54,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:00:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 6 proven. 91 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:00:54,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:00:54,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2019-12-07 18:00:54,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722986978] [2019-12-07 18:00:54,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 18:00:54,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:00:54,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 18:00:54,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=2239, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 18:00:54,535 INFO L87 Difference]: Start difference. First operand 989 states and 1111 transitions. Second operand 49 states. [2019-12-07 18:00:56,079 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-12-07 18:00:58,085 WARN L192 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-12-07 18:00:59,286 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-12-07 18:01:01,462 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-12-07 18:01:04,258 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-12-07 18:01:05,540 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-12-07 18:01:06,252 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-12-07 18:01:06,673 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2019-12-07 18:01:13,189 WARN L192 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2019-12-07 18:01:14,330 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-12-07 18:01:15,538 WARN L192 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-12-07 18:01:16,752 WARN L192 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-12-07 18:01:21,387 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-12-07 18:01:23,698 WARN L192 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-12-07 18:01:28,092 WARN L192 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2019-12-07 18:01:28,311 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-12-07 18:01:34,243 WARN L192 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-12-07 18:01:37,316 WARN L192 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-12-07 18:01:43,033 WARN L192 SmtUtils]: Spent 5.27 s on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2019-12-07 18:01:44,597 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-12-07 18:01:45,195 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-12-07 18:01:46,016 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-12-07 18:01:48,338 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 107 DAG size of output: 83 [2019-12-07 18:01:49,341 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-12-07 18:02:12,736 WARN L192 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-12-07 18:02:15,623 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 87 [2019-12-07 18:02:19,596 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-12-07 18:02:22,769 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-12-07 18:02:49,178 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-12-07 18:02:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:51,820 INFO L93 Difference]: Finished difference Result 4325 states and 4773 transitions. [2019-12-07 18:02:51,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-12-07 18:02:51,821 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 85 [2019-12-07 18:02:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:51,833 INFO L225 Difference]: With dead ends: 4325 [2019-12-07 18:02:51,833 INFO L226 Difference]: Without dead ends: 4250 [2019-12-07 18:02:51,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8515 ImplicationChecksByTransitivity, 89.4s TimeCoverageRelationStatistics Valid=2232, Invalid=26147, Unknown=13, NotChecked=0, Total=28392 [2019-12-07 18:02:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4250 states. [2019-12-07 18:02:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4250 to 1568. [2019-12-07 18:02:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2019-12-07 18:02:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 1750 transitions. [2019-12-07 18:02:51,869 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 1750 transitions. Word has length 85 [2019-12-07 18:02:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:51,869 INFO L462 AbstractCegarLoop]: Abstraction has 1568 states and 1750 transitions. [2019-12-07 18:02:51,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 18:02:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1750 transitions. [2019-12-07 18:02:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 18:02:51,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:51,871 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:52,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:02:52,072 INFO L410 AbstractCegarLoop]: === Iteration 39 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:02:52,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:52,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1870911721, now seen corresponding path program 11 times [2019-12-07 18:02:52,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:52,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370205923] [2019-12-07 18:02:52,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 25 proven. 174 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:02:52,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370205923] [2019-12-07 18:02:52,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066423137] [2019-12-07 18:02:52,348 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:02:52,435 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-07 18:02:52,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:02:52,436 INFO L264 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-07 18:02:52,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:52,585 INFO L377 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-12-07 18:02:52,585 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:52,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:52,590 INFO L534 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-12-07 18:02:52,590 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 18:02:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 25 proven. 174 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:02:52,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:02:52,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 40 [2019-12-07 18:02:52,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137785305] [2019-12-07 18:02:52,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 18:02:52,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:02:52,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 18:02:52,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1453, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 18:02:52,820 INFO L87 Difference]: Start difference. First operand 1568 states and 1750 transitions. Second operand 40 states. [2019-12-07 18:02:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:54,735 INFO L93 Difference]: Finished difference Result 2200 states and 2422 transitions. [2019-12-07 18:02:54,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 18:02:54,735 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2019-12-07 18:02:54,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:54,741 INFO L225 Difference]: With dead ends: 2200 [2019-12-07 18:02:54,741 INFO L226 Difference]: Without dead ends: 2058 [2019-12-07 18:02:54,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=2719, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 18:02:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2019-12-07 18:02:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1889. [2019-12-07 18:02:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1889 states. [2019-12-07 18:02:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2107 transitions. [2019-12-07 18:02:54,764 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2107 transitions. Word has length 91 [2019-12-07 18:02:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:54,764 INFO L462 AbstractCegarLoop]: Abstraction has 1889 states and 2107 transitions. [2019-12-07 18:02:54,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 18:02:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2107 transitions. [2019-12-07 18:02:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 18:02:54,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:54,766 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:54,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:02:54,967 INFO L410 AbstractCegarLoop]: === Iteration 40 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:02:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash 937030938, now seen corresponding path program 12 times [2019-12-07 18:02:54,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:54,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449388812] [2019-12-07 18:02:54,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 68 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:02:55,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449388812] [2019-12-07 18:02:55,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810312466] [2019-12-07 18:02:55,248 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:02:55,383 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-07 18:02:55,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:02:55,384 INFO L264 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 18:02:55,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:55,395 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:55,395 INFO L377 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-12-07 18:02:55,395 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:55,406 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 18:02:55,406 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:55,406 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 18:02:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 66 proven. 158 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:02:55,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:02:55,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2019-12-07 18:02:55,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674996476] [2019-12-07 18:02:55,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 18:02:55,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:02:55,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 18:02:55,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1594, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 18:02:55,798 INFO L87 Difference]: Start difference. First operand 1889 states and 2107 transitions. Second operand 43 states. [2019-12-07 18:02:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:57,346 INFO L93 Difference]: Finished difference Result 2222 states and 2453 transitions. [2019-12-07 18:02:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 18:02:57,346 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 95 [2019-12-07 18:02:57,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:57,352 INFO L225 Difference]: With dead ends: 2222 [2019-12-07 18:02:57,353 INFO L226 Difference]: Without dead ends: 2220 [2019-12-07 18:02:57,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=368, Invalid=2494, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 18:02:57,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-12-07 18:02:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1937. [2019-12-07 18:02:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1937 states. [2019-12-07 18:02:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 2162 transitions. [2019-12-07 18:02:57,372 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 2162 transitions. Word has length 95 [2019-12-07 18:02:57,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:57,372 INFO L462 AbstractCegarLoop]: Abstraction has 1937 states and 2162 transitions. [2019-12-07 18:02:57,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 18:02:57,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2162 transitions. [2019-12-07 18:02:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 18:02:57,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:57,374 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:57,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:02:57,575 INFO L410 AbstractCegarLoop]: === Iteration 41 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:02:57,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:57,576 INFO L82 PathProgramCache]: Analyzing trace with hash 494816939, now seen corresponding path program 3 times [2019-12-07 18:02:57,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:57,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592661357] [2019-12-07 18:02:57,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:02:58,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592661357] [2019-12-07 18:02:58,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087640325] [2019-12-07 18:02:58,088 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:02:58,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-07 18:02:58,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:02:58,181 INFO L264 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 53 conjunts are in the unsatisfiable core [2019-12-07 18:02:58,183 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:02:58,186 INFO L377 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-12-07 18:02:58,186 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:58,188 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:58,189 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:58,189 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-12-07 18:02:58,311 INFO L377 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-12-07 18:02:58,311 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:58,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:58,316 INFO L534 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-12-07 18:02:58,316 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 18:02:58,349 INFO L377 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-12-07 18:02:58,350 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:58,356 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:58,356 INFO L534 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-12-07 18:02:58,357 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2019-12-07 18:02:59,023 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:02:59,023 INFO L377 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 43 treesize of output 70 [2019-12-07 18:02:59,023 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:02:59,050 INFO L614 ElimStorePlain]: treesize reduction 29, result has 57.4 percent of original size [2019-12-07 18:02:59,052 INFO L534 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:02:59,052 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:53, output treesize:8 [2019-12-07 18:02:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 12 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:02:59,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:02:59,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2019-12-07 18:02:59,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128918106] [2019-12-07 18:02:59,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-07 18:02:59,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:02:59,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-07 18:02:59,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1467, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 18:02:59,136 INFO L87 Difference]: Start difference. First operand 1937 states and 2162 transitions. Second operand 40 states. [2019-12-07 18:03:04,655 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-12-07 18:04:38,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:38,070 INFO L93 Difference]: Finished difference Result 2540 states and 2816 transitions. [2019-12-07 18:04:38,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 18:04:38,070 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 95 [2019-12-07 18:04:38,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:38,075 INFO L225 Difference]: With dead ends: 2540 [2019-12-07 18:04:38,075 INFO L226 Difference]: Without dead ends: 1670 [2019-12-07 18:04:38,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=284, Invalid=3740, Unknown=8, NotChecked=0, Total=4032 [2019-12-07 18:04:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-12-07 18:04:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1407. [2019-12-07 18:04:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1407 states. [2019-12-07 18:04:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1578 transitions. [2019-12-07 18:04:38,087 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1578 transitions. Word has length 95 [2019-12-07 18:04:38,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:38,087 INFO L462 AbstractCegarLoop]: Abstraction has 1407 states and 1578 transitions. [2019-12-07 18:04:38,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-07 18:04:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1578 transitions. [2019-12-07 18:04:38,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 18:04:38,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:38,088 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:38,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:04:38,289 INFO L410 AbstractCegarLoop]: === Iteration 42 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:04:38,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:38,289 INFO L82 PathProgramCache]: Analyzing trace with hash 551301102, now seen corresponding path program 4 times [2019-12-07 18:04:38,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:38,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267413801] [2019-12-07 18:04:38,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 17 proven. 111 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 18:04:38,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267413801] [2019-12-07 18:04:38,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428089510] [2019-12-07 18:04:38,440 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:04:38,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:04:38,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:04:38,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 18:04:38,516 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:04:38,518 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_34|], 1=[|v_#valid_40|]} [2019-12-07 18:04:38,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:04:38,521 INFO L377 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-12-07 18:04:38,521 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:04:38,526 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:04:38,528 INFO L377 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-12-07 18:04:38,528 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:04:38,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:04:38,533 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:04:38,533 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2019-12-07 18:04:38,553 INFO L377 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-12-07 18:04:38,553 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:04:38,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:04:38,557 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:04:38,557 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 18:04:38,575 INFO L377 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-12-07 18:04:38,576 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:04:38,580 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:04:38,580 INFO L534 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-12-07 18:04:38,580 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-12-07 18:04:41,040 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 18:04:41,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:04:41,120 INFO L377 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 46 treesize of output 74 [2019-12-07 18:04:41,120 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:04:41,159 INFO L614 ElimStorePlain]: treesize reduction 6, result has 92.1 percent of original size [2019-12-07 18:04:41,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:41,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:04:41,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:41,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:41,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:41,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:04:41,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:41,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:41,162 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:04:41,162 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:27 [2019-12-07 18:04:41,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:04:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 95 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 18:04:41,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:04:41,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2019-12-07 18:04:41,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973748843] [2019-12-07 18:04:41,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 18:04:41,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:41,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 18:04:41,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2019-12-07 18:04:41,255 INFO L87 Difference]: Start difference. First operand 1407 states and 1578 transitions. Second operand 32 states. [2019-12-07 18:04:49,503 WARN L192 SmtUtils]: Spent 5.76 s on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-12-07 18:04:57,437 WARN L192 SmtUtils]: Spent 4.82 s on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-12-07 18:05:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:01,825 INFO L93 Difference]: Finished difference Result 1855 states and 2040 transitions. [2019-12-07 18:05:01,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 18:05:01,825 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 99 [2019-12-07 18:05:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:01,828 INFO L225 Difference]: With dead ends: 1855 [2019-12-07 18:05:01,828 INFO L226 Difference]: Without dead ends: 893 [2019-12-07 18:05:01,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=813, Invalid=4443, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 18:05:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-07 18:05:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 411. [2019-12-07 18:05:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-07 18:05:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 459 transitions. [2019-12-07 18:05:01,832 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 459 transitions. Word has length 99 [2019-12-07 18:05:01,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:01,833 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 459 transitions. [2019-12-07 18:05:01,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 18:05:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 459 transitions. [2019-12-07 18:05:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 18:05:01,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:01,833 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:02,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:02,034 INFO L410 AbstractCegarLoop]: === Iteration 43 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:05:02,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:02,035 INFO L82 PathProgramCache]: Analyzing trace with hash 592464494, now seen corresponding path program 13 times [2019-12-07 18:05:02,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:02,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579809790] [2019-12-07 18:05:02,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 29 proven. 238 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:05:02,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579809790] [2019-12-07 18:05:02,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451516177] [2019-12-07 18:05:02,358 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:05:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:02,444 INFO L264 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 64 conjunts are in the unsatisfiable core [2019-12-07 18:05:02,446 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:02,633 INFO L377 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-12-07 18:05:02,633 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:02,637 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:02,637 INFO L534 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-12-07 18:05:02,637 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 18:05:02,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 18:05:02,791 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:02,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:02,792 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:02,792 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 18:05:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 29 proven. 238 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:05:02,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:02,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 41 [2019-12-07 18:05:02,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299858203] [2019-12-07 18:05:02,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 18:05:02,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:02,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 18:05:02,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1533, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:05:02,809 INFO L87 Difference]: Start difference. First operand 411 states and 459 transitions. Second operand 41 states. [2019-12-07 18:05:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:05,929 INFO L93 Difference]: Finished difference Result 756 states and 825 transitions. [2019-12-07 18:05:05,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 18:05:05,930 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 101 [2019-12-07 18:05:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:05,931 INFO L225 Difference]: With dead ends: 756 [2019-12-07 18:05:05,931 INFO L226 Difference]: Without dead ends: 439 [2019-12-07 18:05:05,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=258, Invalid=2934, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 18:05:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-12-07 18:05:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 427. [2019-12-07 18:05:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-12-07 18:05:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 475 transitions. [2019-12-07 18:05:05,935 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 475 transitions. Word has length 101 [2019-12-07 18:05:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:05,935 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 475 transitions. [2019-12-07 18:05:05,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 18:05:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 475 transitions. [2019-12-07 18:05:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 18:05:05,936 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:05,936 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:06,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:06,137 INFO L410 AbstractCegarLoop]: === Iteration 44 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:05:06,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:06,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1057836879, now seen corresponding path program 14 times [2019-12-07 18:05:06,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:06,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250115369] [2019-12-07 18:05:06,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 93 proven. 203 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:05:06,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250115369] [2019-12-07 18:05:06,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675723750] [2019-12-07 18:05:06,464 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:05:06,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:05:06,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:06,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 61 conjunts are in the unsatisfiable core [2019-12-07 18:05:06,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:06,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:06,551 INFO L377 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-12-07 18:05:06,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:06,567 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 18:05:06,567 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:06,567 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 18:05:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 91 proven. 205 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:05:06,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:06,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 32 [2019-12-07 18:05:06,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407398678] [2019-12-07 18:05:06,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 18:05:06,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:06,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 18:05:06,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 18:05:06,747 INFO L87 Difference]: Start difference. First operand 427 states and 475 transitions. Second operand 33 states. [2019-12-07 18:05:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:08,420 INFO L93 Difference]: Finished difference Result 585 states and 640 transitions. [2019-12-07 18:05:08,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 18:05:08,420 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 105 [2019-12-07 18:05:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:08,422 INFO L225 Difference]: With dead ends: 585 [2019-12-07 18:05:08,422 INFO L226 Difference]: Without dead ends: 583 [2019-12-07 18:05:08,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=1768, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 18:05:08,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-12-07 18:05:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 451. [2019-12-07 18:05:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-12-07 18:05:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 502 transitions. [2019-12-07 18:05:08,426 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 502 transitions. Word has length 105 [2019-12-07 18:05:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:08,426 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 502 transitions. [2019-12-07 18:05:08,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 18:05:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 502 transitions. [2019-12-07 18:05:08,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 18:05:08,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:08,427 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:08,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:08,628 INFO L410 AbstractCegarLoop]: === Iteration 45 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:05:08,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash -612517691, now seen corresponding path program 15 times [2019-12-07 18:05:08,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:08,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190287568] [2019-12-07 18:05:08,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 33 proven. 312 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:05:08,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190287568] [2019-12-07 18:05:08,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145393523] [2019-12-07 18:05:08,978 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:05:09,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-12-07 18:05:09,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:09,117 INFO L264 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 70 conjunts are in the unsatisfiable core [2019-12-07 18:05:09,118 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:09,322 INFO L377 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-12-07 18:05:09,322 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:09,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:09,326 INFO L534 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-12-07 18:05:09,326 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-12-07 18:05:09,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 18:05:09,487 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:09,490 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:09,490 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:09,490 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 18:05:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 33 proven. 312 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:05:09,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:09,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 44 [2019-12-07 18:05:09,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607432329] [2019-12-07 18:05:09,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-07 18:05:09,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:09,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-07 18:05:09,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1777, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 18:05:09,513 INFO L87 Difference]: Start difference. First operand 451 states and 502 transitions. Second operand 44 states. [2019-12-07 18:05:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:11,628 INFO L93 Difference]: Finished difference Result 835 states and 910 transitions. [2019-12-07 18:05:11,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 18:05:11,629 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 111 [2019-12-07 18:05:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:11,630 INFO L225 Difference]: With dead ends: 835 [2019-12-07 18:05:11,630 INFO L226 Difference]: Without dead ends: 479 [2019-12-07 18:05:11,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=276, Invalid=3384, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 18:05:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-12-07 18:05:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 467. [2019-12-07 18:05:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-12-07 18:05:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 518 transitions. [2019-12-07 18:05:11,634 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 518 transitions. Word has length 111 [2019-12-07 18:05:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:11,634 INFO L462 AbstractCegarLoop]: Abstraction has 467 states and 518 transitions. [2019-12-07 18:05:11,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-07 18:05:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 518 transitions. [2019-12-07 18:05:11,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 18:05:11,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:11,635 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:05:11,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:11,835 INFO L410 AbstractCegarLoop]: === Iteration 46 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr8ENSURES_VIOLATIONMEMORY_LEAK, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2019-12-07 18:05:11,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:11,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1840473928, now seen corresponding path program 16 times [2019-12-07 18:05:11,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:11,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942901419] [2019-12-07 18:05:11,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 122 proven. 256 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 18:05:12,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942901419] [2019-12-07 18:05:12,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327889651] [2019-12-07 18:05:12,181 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/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-12-07 18:05:12,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:05:12,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:05:12,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-07 18:05:12,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:05:12,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:12,265 INFO L377 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-12-07 18:05:12,265 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:12,275 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 18:05:12,275 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:12,276 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 18:05:12,279 INFO L377 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-12-07 18:05:12,279 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:05:12,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:12,280 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:12,280 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 18:05:12,635 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:12,635 INFO L377 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-12-07 18:05:12,635 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:05:12,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:05:12,642 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:05:12,642 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-12-07 18:05:12,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:12,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:05:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 176 proven. 49 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 18:05:12,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:05:12,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 41 [2019-12-07 18:05:12,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016145149] [2019-12-07 18:05:12,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 18:05:12,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:12,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 18:05:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 18:05:12,775 INFO L87 Difference]: Start difference. First operand 467 states and 518 transitions. Second operand 42 states. [2019-12-07 18:05:13,548 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-07 18:05:15,438 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 18:05:16,150 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 18:05:17,612 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-07 18:05:18,003 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-12-07 18:05:18,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:18,278 INFO L93 Difference]: Finished difference Result 603 states and 644 transitions. [2019-12-07 18:05:18,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 18:05:18,279 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 115 [2019-12-07 18:05:18,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:18,279 INFO L225 Difference]: With dead ends: 603 [2019-12-07 18:05:18,279 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:05:18,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=457, Invalid=2965, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 18:05:18,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:05:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:05:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:05:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:05:18,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2019-12-07 18:05:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:18,280 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:05:18,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 18:05:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:05:18,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:05:18,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:05:18,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:05:18 BoogieIcfgContainer [2019-12-07 18:05:18,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:05:18,486 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:05:18,486 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:05:18,486 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:05:18,487 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:57:09" (3/4) ... [2019-12-07 18:05:18,489 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:05:18,493 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 18:05:18,493 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 18:05:18,494 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 18:05:18,494 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-07 18:05:18,494 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-07 18:05:18,494 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 18:05:18,494 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2019-12-07 18:05:18,494 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-07 18:05:18,499 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-12-07 18:05:18,499 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 18:05:18,499 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 18:05:18,499 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 18:05:18,532 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f937ed04-6cce-4718-83bc-cda50ee78ec6/bin/uautomizer/witness.graphml [2019-12-07 18:05:18,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:05:18,533 INFO L168 Benchmark]: Toolchain (without parser) took 489231.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:05:18,534 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:05:18,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:18,534 INFO L168 Benchmark]: Boogie Preprocessor took 39.38 ms. Allocated memory is still 1.1 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-12-07 18:05:18,535 INFO L168 Benchmark]: RCFGBuilder took 336.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:18,535 INFO L168 Benchmark]: TraceAbstraction took 488504.88 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 37.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -103.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:05:18,535 INFO L168 Benchmark]: Witness Printer took 46.01 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: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:05:18,536 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 301.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.38 ms. Allocated memory is still 1.1 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 336.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 488504.88 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 37.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -103.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 46.01 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: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: 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 - 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: 552]: 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: 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: 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: 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: 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 - 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: 488.4s, OverallIterations: 46, TraceHistogramMax: 9, AutomataDifference: 456.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2324 SDtfs, 11941 SDslu, 9272 SDs, 0 SdLazy, 56505 SolverSat, 1375 SolverUnsat, 62 SolverUnknown, 0 SolverNotchecked, 150.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3213 GetRequests, 1657 SyntacticMatches, 43 SemanticMatches, 1513 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23242 ImplicationChecksByTransitivity, 318.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1937occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 46 MinimizatonAttempts, 6021 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 4225 NumberOfCodeBlocks, 4163 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 4152 ConstructedInterpolants, 412 QuantifiedInterpolants, 3906675 SizeOfPredicates, 330 NumberOfNonLiveVariables, 7262 ConjunctsInSsa, 1231 ConjunctsInUnsatCore, 73 InterpolantComputations, 19 PerfectInterpolantSequences, 1735/6127 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...