./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/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 436b5c72ff67e2244c8257fbd882ddaf383eff22 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/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 436b5c72ff67e2244c8257fbd882ddaf383eff22 ..................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:23:13,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:23:13,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:23:13,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:23:13,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:23:13,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:23:13,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:23:13,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:23:13,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:23:13,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:23:13,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:23:13,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:23:13,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:23:13,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:23:13,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:23:13,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:23:13,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:23:13,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:23:13,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:23:13,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:23:13,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:23:13,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:23:13,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:23:13,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:23:13,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:23:13,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:23:13,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:23:13,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:23:13,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:23:13,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:23:13,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:23:13,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:23:13,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:23:13,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:23:13,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:23:13,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:23:13,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:23:13,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:23:13,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:23:13,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:23:13,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:23:13,654 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:23:13,666 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:23:13,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:23:13,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:23:13,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:23:13,668 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:23:13,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:23:13,669 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:23:13,669 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:23:13,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:23:13,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:23:13,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:23:13,670 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:23:13,670 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:23:13,670 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:23:13,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:23:13,671 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:23:13,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:23:13,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:23:13,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:23:13,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:23:13,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:23:13,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:23:13,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:23:13,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:23:13,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:23:13,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:23:13,673 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_7f3b2192-8d52-4d66-93fe-9f2b4989a299/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 -> 436b5c72ff67e2244c8257fbd882ddaf383eff22 [2019-11-16 00:23:13,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:23:13,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:23:13,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:23:13,729 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:23:13,729 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:23:13,730 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2019-11-16 00:23:13,796 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/data/e1566e19c/0e99faf81bb84695972911071dca0897/FLAGe6f68a43f [2019-11-16 00:23:14,249 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:23:14,249 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2019-11-16 00:23:14,260 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/data/e1566e19c/0e99faf81bb84695972911071dca0897/FLAGe6f68a43f [2019-11-16 00:23:14,755 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/data/e1566e19c/0e99faf81bb84695972911071dca0897 [2019-11-16 00:23:14,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:23:14,759 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:23:14,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:23:14,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:23:14,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:23:14,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:23:14" (1/1) ... [2019-11-16 00:23:14,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63f8962a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:14, skipping insertion in model container [2019-11-16 00:23:14,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:23:14" (1/1) ... [2019-11-16 00:23:14,774 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:23:14,817 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:23:15,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:23:15,265 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:23:15,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:23:15,381 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:23:15,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:15 WrapperNode [2019-11-16 00:23:15,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:23:15,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:23:15,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:23:15,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:23:15,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:15" (1/1) ... [2019-11-16 00:23:15,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:15" (1/1) ... [2019-11-16 00:23:15,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:15" (1/1) ... [2019-11-16 00:23:15,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:15" (1/1) ... [2019-11-16 00:23:15,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:15" (1/1) ... [2019-11-16 00:23:15,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:15" (1/1) ... [2019-11-16 00:23:15,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:15" (1/1) ... [2019-11-16 00:23:15,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:23:15,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:23:15,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:23:15,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:23:15,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:23:15,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:23:15,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:23:15,576 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:23:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:23:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:23:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:23:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:23:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:23:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:23:15,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:23:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:23:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:23:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:23:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:23:15,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:23:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:23:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:23:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:23:15,579 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:23:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:23:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:23:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:23:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:23:15,580 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:23:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:23:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:23:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:23:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:23:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:23:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:23:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:23:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:23:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:23:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:23:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:23:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:23:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:23:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:23:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:23:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:23:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:23:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:23:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:23:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:23:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:23:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:23:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:23:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:23:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:23:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:23:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:23:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:23:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:23:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:23:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:23:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:23:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:23:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:23:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:23:15,586 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:23:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:23:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:23:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:23:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:23:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:23:15,587 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:23:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:23:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:23:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:23:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:23:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:23:15,588 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:23:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:23:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:23:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:23:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:23:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:23:15,589 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:23:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:23:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:23:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:23:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:23:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:23:15,590 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:23:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:23:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:23:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:23:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:23:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:23:15,591 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:23:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:23:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:23:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:23:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:23:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:23:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:23:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:23:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:23:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:23:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:23:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:23:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:23:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:23:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:23:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:23:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:23:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:23:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:23:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:23:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:23:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:23:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:23:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:23:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:23:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:23:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:23:15,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:23:16,324 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:23:16,325 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-16 00:23:16,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:16 BoogieIcfgContainer [2019-11-16 00:23:16,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:23:16,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:23:16,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:23:16,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:23:16,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:23:14" (1/3) ... [2019-11-16 00:23:16,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78498656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:23:16, skipping insertion in model container [2019-11-16 00:23:16,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:15" (2/3) ... [2019-11-16 00:23:16,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78498656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:23:16, skipping insertion in model container [2019-11-16 00:23:16,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:16" (3/3) ... [2019-11-16 00:23:16,355 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-1.i [2019-11-16 00:23:16,364 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:23:16,384 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2019-11-16 00:23:16,394 INFO L249 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2019-11-16 00:23:16,412 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:23:16,412 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:23:16,412 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:23:16,412 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:23:16,413 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:23:16,413 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:23:16,413 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:23:16,413 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:23:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2019-11-16 00:23:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:23:16,443 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:16,443 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:16,445 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:16,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash -424449852, now seen corresponding path program 1 times [2019-11-16 00:23:16,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:16,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659517530] [2019-11-16 00:23:16,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:16,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:16,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:16,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659517530] [2019-11-16 00:23:16,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:16,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:16,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143552039] [2019-11-16 00:23:16,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:16,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:16,649 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 4 states. [2019-11-16 00:23:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:17,040 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2019-11-16 00:23:17,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:17,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-16 00:23:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:17,056 INFO L225 Difference]: With dead ends: 156 [2019-11-16 00:23:17,056 INFO L226 Difference]: Without dead ends: 153 [2019-11-16 00:23:17,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-16 00:23:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 127. [2019-11-16 00:23:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-16 00:23:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2019-11-16 00:23:17,137 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 7 [2019-11-16 00:23:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:17,137 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2019-11-16 00:23:17,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2019-11-16 00:23:17,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:23:17,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:17,138 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:17,139 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:17,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:17,139 INFO L82 PathProgramCache]: Analyzing trace with hash -424449851, now seen corresponding path program 1 times [2019-11-16 00:23:17,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:17,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599575397] [2019-11-16 00:23:17,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:17,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:17,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:17,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599575397] [2019-11-16 00:23:17,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:17,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:17,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463669395] [2019-11-16 00:23:17,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:17,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:17,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:17,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:17,242 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 4 states. [2019-11-16 00:23:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:17,568 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2019-11-16 00:23:17,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:17,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-16 00:23:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:17,570 INFO L225 Difference]: With dead ends: 124 [2019-11-16 00:23:17,570 INFO L226 Difference]: Without dead ends: 124 [2019-11-16 00:23:17,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-16 00:23:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-11-16 00:23:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-16 00:23:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2019-11-16 00:23:17,580 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 7 [2019-11-16 00:23:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:17,580 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2019-11-16 00:23:17,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2019-11-16 00:23:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:23:17,581 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:17,581 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:17,582 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:17,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:17,583 INFO L82 PathProgramCache]: Analyzing trace with hash -401845243, now seen corresponding path program 1 times [2019-11-16 00:23:17,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:17,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379421258] [2019-11-16 00:23:17,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:17,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:17,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:17,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379421258] [2019-11-16 00:23:17,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:17,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:17,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881288359] [2019-11-16 00:23:17,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:17,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:17,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:17,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:17,671 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 4 states. [2019-11-16 00:23:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:17,959 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-11-16 00:23:17,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:17,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-16 00:23:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:17,961 INFO L225 Difference]: With dead ends: 121 [2019-11-16 00:23:17,961 INFO L226 Difference]: Without dead ends: 121 [2019-11-16 00:23:17,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-16 00:23:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-11-16 00:23:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-16 00:23:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2019-11-16 00:23:17,969 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 10 [2019-11-16 00:23:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:17,970 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2019-11-16 00:23:17,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2019-11-16 00:23:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:23:17,971 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:17,971 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:17,972 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash -401845242, now seen corresponding path program 1 times [2019-11-16 00:23:17,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:17,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200647469] [2019-11-16 00:23:17,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:17,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:17,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:18,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200647469] [2019-11-16 00:23:18,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:18,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:18,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134807641] [2019-11-16 00:23:18,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:18,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:18,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:18,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:18,050 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2019-11-16 00:23:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:18,326 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-11-16 00:23:18,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:18,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-16 00:23:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:18,327 INFO L225 Difference]: With dead ends: 137 [2019-11-16 00:23:18,327 INFO L226 Difference]: Without dead ends: 137 [2019-11-16 00:23:18,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-16 00:23:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2019-11-16 00:23:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-16 00:23:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2019-11-16 00:23:18,334 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 10 [2019-11-16 00:23:18,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:18,335 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2019-11-16 00:23:18,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2019-11-16 00:23:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:23:18,335 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:18,335 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:18,336 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1642440688, now seen corresponding path program 1 times [2019-11-16 00:23:18,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:18,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409606554] [2019-11-16 00:23:18,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:18,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:18,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:18,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409606554] [2019-11-16 00:23:18,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:18,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:23:18,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407600004] [2019-11-16 00:23:18,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:23:18,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:18,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:23:18,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:18,434 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 5 states. [2019-11-16 00:23:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:18,670 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-11-16 00:23:18,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:23:18,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-16 00:23:18,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:18,671 INFO L225 Difference]: With dead ends: 128 [2019-11-16 00:23:18,671 INFO L226 Difference]: Without dead ends: 128 [2019-11-16 00:23:18,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-16 00:23:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2019-11-16 00:23:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-16 00:23:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-11-16 00:23:18,679 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 15 [2019-11-16 00:23:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:18,679 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-11-16 00:23:18,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:23:18,679 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-11-16 00:23:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-16 00:23:18,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:18,680 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:18,681 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:18,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1642440687, now seen corresponding path program 1 times [2019-11-16 00:23:18,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:18,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832188113] [2019-11-16 00:23:18,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:18,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:18,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:18,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:18,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832188113] [2019-11-16 00:23:18,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:18,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:23:18,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415145383] [2019-11-16 00:23:18,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:23:18,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:23:18,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:18,806 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 5 states. [2019-11-16 00:23:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:19,120 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2019-11-16 00:23:19,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:23:19,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-16 00:23:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:19,121 INFO L225 Difference]: With dead ends: 151 [2019-11-16 00:23:19,121 INFO L226 Difference]: Without dead ends: 151 [2019-11-16 00:23:19,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-16 00:23:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 121. [2019-11-16 00:23:19,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-16 00:23:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2019-11-16 00:23:19,127 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 15 [2019-11-16 00:23:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:19,127 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2019-11-16 00:23:19,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:23:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2019-11-16 00:23:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:23:19,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:19,128 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:19,129 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:19,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:19,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1683100079, now seen corresponding path program 1 times [2019-11-16 00:23:19,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:19,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212515621] [2019-11-16 00:23:19,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:19,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:19,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:19,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212515621] [2019-11-16 00:23:19,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:19,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:19,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576815984] [2019-11-16 00:23:19,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:19,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:19,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:19,212 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 7 states. [2019-11-16 00:23:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:19,684 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2019-11-16 00:23:19,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:19,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-16 00:23:19,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:19,687 INFO L225 Difference]: With dead ends: 190 [2019-11-16 00:23:19,688 INFO L226 Difference]: Without dead ends: 190 [2019-11-16 00:23:19,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-16 00:23:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 120. [2019-11-16 00:23:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-16 00:23:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2019-11-16 00:23:19,695 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 18 [2019-11-16 00:23:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:19,695 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2019-11-16 00:23:19,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2019-11-16 00:23:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:23:19,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:19,696 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:19,697 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:19,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:19,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1683100078, now seen corresponding path program 1 times [2019-11-16 00:23:19,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:19,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723847501] [2019-11-16 00:23:19,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:19,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:19,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:19,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723847501] [2019-11-16 00:23:19,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:19,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:19,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824847308] [2019-11-16 00:23:19,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:19,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:19,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:19,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:19,806 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 7 states. [2019-11-16 00:23:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:20,342 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2019-11-16 00:23:20,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:23:20,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-16 00:23:20,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:20,344 INFO L225 Difference]: With dead ends: 199 [2019-11-16 00:23:20,344 INFO L226 Difference]: Without dead ends: 199 [2019-11-16 00:23:20,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:23:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-16 00:23:20,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 115. [2019-11-16 00:23:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-16 00:23:20,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-11-16 00:23:20,349 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 18 [2019-11-16 00:23:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:20,349 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-11-16 00:23:20,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2019-11-16 00:23:20,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:23:20,350 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:20,350 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:20,351 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:20,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:20,351 INFO L82 PathProgramCache]: Analyzing trace with hash 405055676, now seen corresponding path program 1 times [2019-11-16 00:23:20,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:20,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561946697] [2019-11-16 00:23:20,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:20,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:20,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:20,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561946697] [2019-11-16 00:23:20,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:20,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:23:20,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483234385] [2019-11-16 00:23:20,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:20,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:20,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:20,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:20,480 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 7 states. [2019-11-16 00:23:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:20,745 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2019-11-16 00:23:20,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:20,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-11-16 00:23:20,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:20,747 INFO L225 Difference]: With dead ends: 141 [2019-11-16 00:23:20,747 INFO L226 Difference]: Without dead ends: 141 [2019-11-16 00:23:20,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:23:20,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-16 00:23:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2019-11-16 00:23:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-16 00:23:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-11-16 00:23:20,752 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 24 [2019-11-16 00:23:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:20,752 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-11-16 00:23:20,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-11-16 00:23:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:23:20,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:20,754 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:20,755 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:20,758 INFO L82 PathProgramCache]: Analyzing trace with hash 881818048, now seen corresponding path program 1 times [2019-11-16 00:23:20,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:20,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120943777] [2019-11-16 00:23:20,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:20,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:20,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:20,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120943777] [2019-11-16 00:23:20,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:20,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:20,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352099352] [2019-11-16 00:23:20,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:20,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:20,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:20,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:20,872 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 7 states. [2019-11-16 00:23:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:21,439 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2019-11-16 00:23:21,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:21,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-16 00:23:21,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:21,441 INFO L225 Difference]: With dead ends: 177 [2019-11-16 00:23:21,441 INFO L226 Difference]: Without dead ends: 177 [2019-11-16 00:23:21,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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-11-16 00:23:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-16 00:23:21,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 114. [2019-11-16 00:23:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-16 00:23:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-11-16 00:23:21,446 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 26 [2019-11-16 00:23:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:21,446 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-11-16 00:23:21,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-11-16 00:23:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:23:21,447 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:21,447 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:21,448 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:21,448 INFO L82 PathProgramCache]: Analyzing trace with hash 881818049, now seen corresponding path program 1 times [2019-11-16 00:23:21,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:21,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554664439] [2019-11-16 00:23:21,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:21,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:21,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:21,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554664439] [2019-11-16 00:23:21,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:21,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:21,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225082674] [2019-11-16 00:23:21,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:21,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:21,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:21,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:21,533 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 7 states. [2019-11-16 00:23:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:22,010 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2019-11-16 00:23:22,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:23:22,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-16 00:23:22,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:22,011 INFO L225 Difference]: With dead ends: 201 [2019-11-16 00:23:22,011 INFO L226 Difference]: Without dead ends: 201 [2019-11-16 00:23:22,012 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-16 00:23:22,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 106. [2019-11-16 00:23:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-16 00:23:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2019-11-16 00:23:22,016 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 26 [2019-11-16 00:23:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:22,017 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2019-11-16 00:23:22,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2019-11-16 00:23:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:23:22,018 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:22,018 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:22,019 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:22,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:22,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1815582269, now seen corresponding path program 1 times [2019-11-16 00:23:22,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:22,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119767942] [2019-11-16 00:23:22,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:22,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:22,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:22,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119767942] [2019-11-16 00:23:22,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183134936] [2019-11-16 00:23:22,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:22,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-16 00:23:22,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:22,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:22,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:22,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:22,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:22,382 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:22,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:22,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:22,388 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-11-16 00:23:22,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:22,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-16 00:23:22,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:22,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:22,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:22,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-16 00:23:22,430 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:22,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:22,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:22,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:15 [2019-11-16 00:23:22,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:23:22,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:22,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:22,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:23:22,466 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:22,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:22,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:22,471 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-16 00:23:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:22,476 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:22,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-11-16 00:23:22,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896594898] [2019-11-16 00:23:22,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:22,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:22,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:22,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:22,477 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 7 states. [2019-11-16 00:23:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:22,913 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2019-11-16 00:23:22,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:23:22,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-16 00:23:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:22,915 INFO L225 Difference]: With dead ends: 169 [2019-11-16 00:23:22,915 INFO L226 Difference]: Without dead ends: 169 [2019-11-16 00:23:22,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:23:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-16 00:23:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 120. [2019-11-16 00:23:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-16 00:23:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2019-11-16 00:23:22,920 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 27 [2019-11-16 00:23:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:22,920 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2019-11-16 00:23:22,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2019-11-16 00:23:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-16 00:23:22,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:22,921 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:23,131 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1632709297, now seen corresponding path program 1 times [2019-11-16 00:23:23,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:23,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830832040] [2019-11-16 00:23:23,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:23,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830832040] [2019-11-16 00:23:23,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:23,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:23,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711899528] [2019-11-16 00:23:23,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:23,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:23,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:23,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:23,302 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 6 states. [2019-11-16 00:23:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:23,548 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2019-11-16 00:23:23,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:23:23,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-16 00:23:23,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:23,550 INFO L225 Difference]: With dead ends: 123 [2019-11-16 00:23:23,550 INFO L226 Difference]: Without dead ends: 123 [2019-11-16 00:23:23,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-16 00:23:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2019-11-16 00:23:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-16 00:23:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2019-11-16 00:23:23,555 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 28 [2019-11-16 00:23:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:23,555 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2019-11-16 00:23:23,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2019-11-16 00:23:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:23:23,556 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:23,556 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:23,556 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:23,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:23,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1017836257, now seen corresponding path program 1 times [2019-11-16 00:23:23,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:23,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785648524] [2019-11-16 00:23:23,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:23,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:23,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785648524] [2019-11-16 00:23:23,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021038395] [2019-11-16 00:23:23,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:23:23,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:23:23,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:23:23,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2019-11-16 00:23:23,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223480980] [2019-11-16 00:23:23,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:23:23,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:23,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:23:23,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:23:23,834 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 3 states. [2019-11-16 00:23:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:23,878 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-11-16 00:23:23,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:23:23,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-16 00:23:23,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:23,879 INFO L225 Difference]: With dead ends: 118 [2019-11-16 00:23:23,879 INFO L226 Difference]: Without dead ends: 118 [2019-11-16 00:23:23,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:23:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-16 00:23:23,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-16 00:23:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-16 00:23:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2019-11-16 00:23:23,883 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 29 [2019-11-16 00:23:23,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:23,883 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2019-11-16 00:23:23,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:23:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2019-11-16 00:23:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:23:23,884 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:23,884 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:24,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:24,085 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:24,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:24,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1111908482, now seen corresponding path program 1 times [2019-11-16 00:23:24,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:24,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750375315] [2019-11-16 00:23:24,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:24,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750375315] [2019-11-16 00:23:24,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977280122] [2019-11-16 00:23:24,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:24,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:23:24,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:24,344 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:24,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:23:24,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:24,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:24,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:24,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-16 00:23:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:23:24,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:23:24,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2019-11-16 00:23:24,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743837842] [2019-11-16 00:23:24,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:24,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:24,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:24,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:23:24,351 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 4 states. [2019-11-16 00:23:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:24,487 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2019-11-16 00:23:24,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:24,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-16 00:23:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:24,488 INFO L225 Difference]: With dead ends: 154 [2019-11-16 00:23:24,488 INFO L226 Difference]: Without dead ends: 154 [2019-11-16 00:23:24,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-16 00:23:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2019-11-16 00:23:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-16 00:23:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2019-11-16 00:23:24,493 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 31 [2019-11-16 00:23:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:24,493 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2019-11-16 00:23:24,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2019-11-16 00:23:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-16 00:23:24,501 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:24,501 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:24,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:24,710 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:24,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:24,711 INFO L82 PathProgramCache]: Analyzing trace with hash -397046487, now seen corresponding path program 1 times [2019-11-16 00:23:24,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:24,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692840549] [2019-11-16 00:23:24,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:24,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:24,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692840549] [2019-11-16 00:23:24,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539779134] [2019-11-16 00:23:24,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:24,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:23:24,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:23:24,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:23:24,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2019-11-16 00:23:24,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642877634] [2019-11-16 00:23:24,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:23:24,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:24,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:23:24,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:24,979 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand 3 states. [2019-11-16 00:23:25,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:25,031 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2019-11-16 00:23:25,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:23:25,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-16 00:23:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:25,033 INFO L225 Difference]: With dead ends: 122 [2019-11-16 00:23:25,033 INFO L226 Difference]: Without dead ends: 122 [2019-11-16 00:23:25,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-16 00:23:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-11-16 00:23:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-16 00:23:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2019-11-16 00:23:25,037 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 33 [2019-11-16 00:23:25,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:25,037 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2019-11-16 00:23:25,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:23:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2019-11-16 00:23:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:23:25,038 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:25,039 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:25,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:25,240 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:25,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:25,240 INFO L82 PathProgramCache]: Analyzing trace with hash 690422284, now seen corresponding path program 1 times [2019-11-16 00:23:25,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:25,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711566722] [2019-11-16 00:23:25,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:25,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711566722] [2019-11-16 00:23:25,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919745113] [2019-11-16 00:23:25,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:25,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:23:25,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:25,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:23:25,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:25,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:25,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:25,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:23:25,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-16 00:23:25,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:25,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:25,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:25,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-16 00:23:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:23:25,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:23:25,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2019-11-16 00:23:25,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613436459] [2019-11-16 00:23:25,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:25,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:25,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:25,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:25,475 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 4 states. [2019-11-16 00:23:25,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:25,543 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-11-16 00:23:25,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:25,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-16 00:23:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:25,544 INFO L225 Difference]: With dead ends: 131 [2019-11-16 00:23:25,544 INFO L226 Difference]: Without dead ends: 131 [2019-11-16 00:23:25,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:23:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-16 00:23:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2019-11-16 00:23:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-16 00:23:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2019-11-16 00:23:25,548 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 35 [2019-11-16 00:23:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:25,548 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2019-11-16 00:23:25,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2019-11-16 00:23:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:23:25,549 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:25,550 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:25,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:25,751 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:25,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:25,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1683544525, now seen corresponding path program 1 times [2019-11-16 00:23:25,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:25,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441337495] [2019-11-16 00:23:25,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:25,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441337495] [2019-11-16 00:23:25,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486472083] [2019-11-16 00:23:25,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:26,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-16 00:23:26,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:26,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:26,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:26,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:26,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:26,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-16 00:23:26,066 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_34|], 2=[|v_#memory_$Pointer$.base_35|]} [2019-11-16 00:23:26,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-11-16 00:23:26,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:26,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:26,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:26,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-16 00:23:26,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:26,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:26,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:26,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:11 [2019-11-16 00:23:26,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:23:26,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:26,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:26,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:23:26,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:26,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:26,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:26,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2019-11-16 00:23:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:26,311 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:26,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2019-11-16 00:23:26,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449054230] [2019-11-16 00:23:26,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-16 00:23:26,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:26,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:23:26,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:23:26,313 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 17 states. [2019-11-16 00:23:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:27,001 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2019-11-16 00:23:27,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:23:27,001 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-11-16 00:23:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:27,002 INFO L225 Difference]: With dead ends: 181 [2019-11-16 00:23:27,002 INFO L226 Difference]: Without dead ends: 181 [2019-11-16 00:23:27,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:23:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-16 00:23:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 136. [2019-11-16 00:23:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-16 00:23:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2019-11-16 00:23:27,007 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 36 [2019-11-16 00:23:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:27,008 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2019-11-16 00:23:27,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-16 00:23:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2019-11-16 00:23:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:23:27,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:27,009 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-11-16 00:23:27,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:27,212 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:27,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:27,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2057728756, now seen corresponding path program 1 times [2019-11-16 00:23:27,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:27,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092546266] [2019-11-16 00:23:27,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:27,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:27,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:27,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092546266] [2019-11-16 00:23:27,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421202763] [2019-11-16 00:23:27,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:27,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-16 00:23:27,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:27,651 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 1=[|v_#valid_74|]} [2019-11-16 00:23:27,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:23:27,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:27,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:27,675 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:27,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:23:27,676 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:27,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:27,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:27,685 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-16 00:23:27,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:27,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:27,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:27,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:27,737 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:27,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:27,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:27,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2019-11-16 00:23:27,861 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:27,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-16 00:23:27,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:27,898 INFO L567 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2019-11-16 00:23:27,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:23:27,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:27,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:27,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:27,922 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:31 [2019-11-16 00:23:27,954 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_38|], 6=[|v_#memory_$Pointer$.offset_37|]} [2019-11-16 00:23:27,973 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:27,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2019-11-16 00:23:27,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:27,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:27,997 INFO L567 ElimStorePlain]: treesize reduction 32, result has 67.7 percent of original size [2019-11-16 00:23:28,007 INFO L341 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2019-11-16 00:23:28,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2019-11-16 00:23:28,008 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:28,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:28,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:28,015 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:36 [2019-11-16 00:23:28,114 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-16 00:23:28,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-16 00:23:28,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:28,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:28,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:23:28,132 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:28,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:28,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:28,139 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:9 [2019-11-16 00:23:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:28,147 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:28,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2019-11-16 00:23:28,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029189082] [2019-11-16 00:23:28,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-16 00:23:28,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:28,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-16 00:23:28,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:23:28,148 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand 23 states. [2019-11-16 00:23:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:29,584 INFO L93 Difference]: Finished difference Result 219 states and 237 transitions. [2019-11-16 00:23:29,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:23:29,585 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2019-11-16 00:23:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:29,586 INFO L225 Difference]: With dead ends: 219 [2019-11-16 00:23:29,586 INFO L226 Difference]: Without dead ends: 219 [2019-11-16 00:23:29,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:23:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-16 00:23:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 161. [2019-11-16 00:23:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-16 00:23:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2019-11-16 00:23:29,592 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 36 [2019-11-16 00:23:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:29,592 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2019-11-16 00:23:29,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-16 00:23:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2019-11-16 00:23:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:23:29,593 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:29,593 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-11-16 00:23:29,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:29,797 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2057728755, now seen corresponding path program 1 times [2019-11-16 00:23:29,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:29,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880667868] [2019-11-16 00:23:29,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:29,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:29,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:29,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880667868] [2019-11-16 00:23:29,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223673890] [2019-11-16 00:23:29,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:30,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:23:30,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:30,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:30,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:23:30,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,171 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-16 00:23:30,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-16 00:23:30,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:30,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:30,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-16 00:23:30,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:30,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-16 00:23:30,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,334 INFO L567 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-11-16 00:23:30,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:22 [2019-11-16 00:23:30,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:30,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 69 [2019-11-16 00:23:30,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:30,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:30,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:30,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-16 00:23:30,430 INFO L567 ElimStorePlain]: treesize reduction 60, result has 28.6 percent of original size [2019-11-16 00:23:30,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:23 [2019-11-16 00:23:30,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:23:30,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:30,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:30,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:30,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2019-11-16 00:23:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:30,586 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:30,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-11-16 00:23:30,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882105156] [2019-11-16 00:23:30,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-16 00:23:30,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:30,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:23:30,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:23:30,589 INFO L87 Difference]: Start difference. First operand 161 states and 176 transitions. Second operand 22 states. [2019-11-16 00:23:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:31,670 INFO L93 Difference]: Finished difference Result 235 states and 255 transitions. [2019-11-16 00:23:31,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:23:31,671 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-11-16 00:23:31,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:31,672 INFO L225 Difference]: With dead ends: 235 [2019-11-16 00:23:31,672 INFO L226 Difference]: Without dead ends: 235 [2019-11-16 00:23:31,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:23:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-16 00:23:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 161. [2019-11-16 00:23:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-16 00:23:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2019-11-16 00:23:31,677 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 36 [2019-11-16 00:23:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:31,678 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2019-11-16 00:23:31,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-16 00:23:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2019-11-16 00:23:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-16 00:23:31,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:31,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:31,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:31,881 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:31,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:31,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2142209156, now seen corresponding path program 1 times [2019-11-16 00:23:31,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:31,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366333313] [2019-11-16 00:23:31,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:31,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:31,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:32,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366333313] [2019-11-16 00:23:32,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591912697] [2019-11-16 00:23:32,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:32,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-16 00:23:32,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:23:32,487 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:32,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-16 00:23:32,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251038335] [2019-11-16 00:23:32,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-16 00:23:32,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:32,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-16 00:23:32,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:23:32,488 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand 17 states. [2019-11-16 00:23:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:33,193 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2019-11-16 00:23:33,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:23:33,193 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-11-16 00:23:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:33,194 INFO L225 Difference]: With dead ends: 171 [2019-11-16 00:23:33,194 INFO L226 Difference]: Without dead ends: 146 [2019-11-16 00:23:33,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:23:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-16 00:23:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-16 00:23:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-16 00:23:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2019-11-16 00:23:33,198 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 39 [2019-11-16 00:23:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:33,199 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2019-11-16 00:23:33,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-16 00:23:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2019-11-16 00:23:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-16 00:23:33,201 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:33,201 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-11-16 00:23:33,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:33,405 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:33,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:33,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1800901615, now seen corresponding path program 2 times [2019-11-16 00:23:33,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:33,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999109763] [2019-11-16 00:23:33,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:33,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:33,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:33,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999109763] [2019-11-16 00:23:33,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027589255] [2019-11-16 00:23:33,800 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:33,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:23:33,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:23:33,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-16 00:23:33,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:34,080 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:34,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:23:34,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:34,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2019-11-16 00:23:34,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:34,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:34,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:34,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:34,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2019-11-16 00:23:34,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:34,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:23:34,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,290 INFO L567 ElimStorePlain]: treesize reduction 3, result has 94.3 percent of original size [2019-11-16 00:23:34,317 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:34,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 38 [2019-11-16 00:23:34,318 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,346 INFO L567 ElimStorePlain]: treesize reduction 16, result has 72.4 percent of original size [2019-11-16 00:23:34,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,347 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:42 [2019-11-16 00:23:34,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2019-11-16 00:23:34,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:34,443 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:34,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2019-11-16 00:23:34,444 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,474 INFO L567 ElimStorePlain]: treesize reduction 24, result has 64.7 percent of original size [2019-11-16 00:23:34,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,475 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:44 [2019-11-16 00:23:34,676 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-16 00:23:34,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 43 [2019-11-16 00:23:34,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:34,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:34,679 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:34,706 INFO L567 ElimStorePlain]: treesize reduction 8, result has 81.8 percent of original size [2019-11-16 00:23:34,716 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:34,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:23:34,717 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:34,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,727 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:10 [2019-11-16 00:23:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:34,803 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:34,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-11-16 00:23:34,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354096445] [2019-11-16 00:23:34,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-16 00:23:34,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-16 00:23:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:23:34,805 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand 31 states. [2019-11-16 00:23:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:36,252 INFO L93 Difference]: Finished difference Result 202 states and 219 transitions. [2019-11-16 00:23:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-16 00:23:36,254 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2019-11-16 00:23:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:36,255 INFO L225 Difference]: With dead ends: 202 [2019-11-16 00:23:36,256 INFO L226 Difference]: Without dead ends: 202 [2019-11-16 00:23:36,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=304, Invalid=1766, Unknown=0, NotChecked=0, Total=2070 [2019-11-16 00:23:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-16 00:23:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 148. [2019-11-16 00:23:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-16 00:23:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2019-11-16 00:23:36,260 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 41 [2019-11-16 00:23:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:36,261 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2019-11-16 00:23:36,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-16 00:23:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2019-11-16 00:23:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:23:36,261 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:36,261 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:36,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:36,481 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:36,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1190858589, now seen corresponding path program 1 times [2019-11-16 00:23:36,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:36,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80764688] [2019-11-16 00:23:36,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:36,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:36,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:36,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80764688] [2019-11-16 00:23:36,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820690368] [2019-11-16 00:23:36,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:36,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-16 00:23:36,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:36,906 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:36,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:23:36,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:36,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:36,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:36,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-16 00:23:36,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:36,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:36,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:36,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:36,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:36,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:36,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:36,968 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-11-16 00:23:37,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:37,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-16 00:23:37,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:37,119 INFO L567 ElimStorePlain]: treesize reduction 27, result has 63.5 percent of original size [2019-11-16 00:23:37,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:23:37,122 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:37,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:37,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:37,133 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:39 [2019-11-16 00:23:37,192 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:37,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 98 [2019-11-16 00:23:37,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:37,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:37,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:37,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:37,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:37,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:37,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:37,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-11-16 00:23:37,281 INFO L567 ElimStorePlain]: treesize reduction 332, result has 17.2 percent of original size [2019-11-16 00:23:37,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 44 [2019-11-16 00:23:37,286 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:37,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:37,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:37,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:41 [2019-11-16 00:23:37,465 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:37,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 63 [2019-11-16 00:23:37,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:37,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:37,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:37,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:37,468 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:37,503 INFO L567 ElimStorePlain]: treesize reduction 28, result has 56.3 percent of original size [2019-11-16 00:23:37,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:37,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:23:37,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:37,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:37,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:37,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:10 [2019-11-16 00:23:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:37,588 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:37,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-11-16 00:23:37,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124552146] [2019-11-16 00:23:37,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-16 00:23:37,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:37,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-16 00:23:37,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:23:37,590 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 30 states. [2019-11-16 00:23:39,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:39,030 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2019-11-16 00:23:39,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:23:39,031 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2019-11-16 00:23:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:39,032 INFO L225 Difference]: With dead ends: 185 [2019-11-16 00:23:39,032 INFO L226 Difference]: Without dead ends: 182 [2019-11-16 00:23:39,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=1633, Unknown=0, NotChecked=0, Total=1892 [2019-11-16 00:23:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-16 00:23:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 147. [2019-11-16 00:23:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-16 00:23:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2019-11-16 00:23:39,036 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 42 [2019-11-16 00:23:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:39,037 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2019-11-16 00:23:39,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-16 00:23:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2019-11-16 00:23:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:23:39,037 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:39,037 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:39,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:39,238 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1300671821, now seen corresponding path program 1 times [2019-11-16 00:23:39,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:39,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955077923] [2019-11-16 00:23:39,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:39,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:39,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:39,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955077923] [2019-11-16 00:23:39,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681142877] [2019-11-16 00:23:39,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:39,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-16 00:23:39,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:39,944 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:39,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:23:39,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:39,968 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-16 00:23:39,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:39,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-16 00:23:40,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:40,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:40,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-16 00:23:40,155 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-16 00:23:40,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,194 INFO L567 ElimStorePlain]: treesize reduction 24, result has 68.8 percent of original size [2019-11-16 00:23:40,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:23:40,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,212 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2019-11-16 00:23:40,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:40,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:23:40,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:40,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:23:40,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,341 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-16 00:23:40,431 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_56|], 3=[|v_#valid_83|]} [2019-11-16 00:23:40,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:40,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-16 00:23:40,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,479 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-16 00:23:40,479 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,500 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2019-11-16 00:23:40,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:23:40,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:23:40,579 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,598 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-11-16 00:23:40,749 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_48|], 6=[|v_#memory_$Pointer$.base_52|]} [2019-11-16 00:23:40,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:40,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:23:40,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:40,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,857 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 112 [2019-11-16 00:23:40,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:40,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:40,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,872 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:40,926 INFO L567 ElimStorePlain]: treesize reduction 60, result has 51.2 percent of original size [2019-11-16 00:23:40,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:40,926 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:65 [2019-11-16 00:23:40,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:40,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-11-16 00:23:40,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:41,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:41,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:41,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 147 [2019-11-16 00:23:41,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:41,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:41,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:41,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:41,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:41,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:41,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:41,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:41,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:41,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:41,085 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:41,151 INFO L567 ElimStorePlain]: treesize reduction 661, result has 11.6 percent of original size [2019-11-16 00:23:41,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:41,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:172, output treesize:86 [2019-11-16 00:23:41,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:41,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 50 [2019-11-16 00:23:41,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:41,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:41,357 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:41,402 INFO L567 ElimStorePlain]: treesize reduction 12, result has 80.3 percent of original size [2019-11-16 00:23:41,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:23:41,410 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:41,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:41,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:41,431 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:100, output treesize:18 [2019-11-16 00:23:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:41,535 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:41,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2019-11-16 00:23:41,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44169860] [2019-11-16 00:23:41,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-16 00:23:41,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:41,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-16 00:23:41,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2019-11-16 00:23:41,536 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 35 states. [2019-11-16 00:23:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:45,142 INFO L93 Difference]: Finished difference Result 254 states and 275 transitions. [2019-11-16 00:23:45,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-16 00:23:45,143 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2019-11-16 00:23:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:45,144 INFO L225 Difference]: With dead ends: 254 [2019-11-16 00:23:45,144 INFO L226 Difference]: Without dead ends: 254 [2019-11-16 00:23:45,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=471, Invalid=3069, Unknown=0, NotChecked=0, Total=3540 [2019-11-16 00:23:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-16 00:23:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 172. [2019-11-16 00:23:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-16 00:23:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 188 transitions. [2019-11-16 00:23:45,148 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 188 transitions. Word has length 42 [2019-11-16 00:23:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:45,148 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 188 transitions. [2019-11-16 00:23:45,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-16 00:23:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2019-11-16 00:23:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:23:45,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:45,149 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:45,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:45,350 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:45,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:45,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1300671820, now seen corresponding path program 1 times [2019-11-16 00:23:45,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:45,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890072819] [2019-11-16 00:23:45,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:45,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:45,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:45,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890072819] [2019-11-16 00:23:45,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430942874] [2019-11-16 00:23:45,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:45,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-16 00:23:45,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:45,852 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:45,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:23:45,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:45,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:45,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:45,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-16 00:23:45,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:45,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:45,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:45,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:45,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-16 00:23:45,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:45,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:23:45,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:45,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:45,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:45,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:24 [2019-11-16 00:23:45,977 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-16 00:23:45,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:23:45,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:45,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:45,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:45,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2019-11-16 00:23:45,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:45,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:23:45,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:46,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:46,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:46,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2019-11-16 00:23:46,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:23:46,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:46,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:46,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:46,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2019-11-16 00:23:46,180 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:46,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 101 [2019-11-16 00:23:46,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:46,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:46,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,189 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:46,233 INFO L567 ElimStorePlain]: treesize reduction 52, result has 45.3 percent of original size [2019-11-16 00:23:46,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:46,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:41 [2019-11-16 00:23:46,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,287 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:46,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 69 [2019-11-16 00:23:46,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:46,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-16 00:23:46,327 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:46,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 129 [2019-11-16 00:23:46,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:46,330 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:46,356 INFO L567 ElimStorePlain]: treesize reduction 282, result has 6.0 percent of original size [2019-11-16 00:23:46,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:46,356 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:18 [2019-11-16 00:23:46,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:23:46,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:46,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:46,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:46,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-11-16 00:23:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:46,412 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:46,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 24 [2019-11-16 00:23:46,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767961196] [2019-11-16 00:23:46,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-16 00:23:46,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:46,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-16 00:23:46,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:23:46,413 INFO L87 Difference]: Start difference. First operand 172 states and 188 transitions. Second operand 25 states. [2019-11-16 00:23:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:47,696 INFO L93 Difference]: Finished difference Result 224 states and 243 transitions. [2019-11-16 00:23:47,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:23:47,696 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-11-16 00:23:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:47,697 INFO L225 Difference]: With dead ends: 224 [2019-11-16 00:23:47,697 INFO L226 Difference]: Without dead ends: 224 [2019-11-16 00:23:47,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=285, Invalid=1437, Unknown=0, NotChecked=0, Total=1722 [2019-11-16 00:23:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-16 00:23:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2019-11-16 00:23:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-16 00:23:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2019-11-16 00:23:47,701 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 42 [2019-11-16 00:23:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:47,702 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2019-11-16 00:23:47,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-16 00:23:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2019-11-16 00:23:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-16 00:23:47,703 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:47,703 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:47,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:47,906 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash 453331517, now seen corresponding path program 1 times [2019-11-16 00:23:47,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:47,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888708250] [2019-11-16 00:23:47,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:47,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:47,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:23:48,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888708250] [2019-11-16 00:23:48,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918813208] [2019-11-16 00:23:48,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:48,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-16 00:23:48,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:48,599 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:48,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:23:48,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:48,620 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-16 00:23:48,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:48,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-16 00:23:48,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:48,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:48,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:48,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:48,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-11-16 00:23:48,804 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:48,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-16 00:23:48,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:48,826 INFO L567 ElimStorePlain]: treesize reduction 24, result has 57.1 percent of original size [2019-11-16 00:23:48,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:48,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:25 [2019-11-16 00:23:48,865 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:48,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 69 [2019-11-16 00:23:48,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:48,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:48,880 INFO L567 ElimStorePlain]: treesize reduction 32, result has 44.8 percent of original size [2019-11-16 00:23:48,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:48,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:26 [2019-11-16 00:23:48,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:23:48,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:48,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:48,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:48,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-11-16 00:23:49,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2019-11-16 00:23:49,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:49,012 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-16 00:23:49,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:49,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-16 00:23:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:23:49,048 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:49,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 29 [2019-11-16 00:23:49,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937383501] [2019-11-16 00:23:49,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-16 00:23:49,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:49,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-16 00:23:49,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:23:49,049 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand 30 states. [2019-11-16 00:23:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:51,242 INFO L93 Difference]: Finished difference Result 214 states and 231 transitions. [2019-11-16 00:23:51,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-16 00:23:51,243 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2019-11-16 00:23:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:51,244 INFO L225 Difference]: With dead ends: 214 [2019-11-16 00:23:51,244 INFO L226 Difference]: Without dead ends: 214 [2019-11-16 00:23:51,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=671, Invalid=2635, Unknown=0, NotChecked=0, Total=3306 [2019-11-16 00:23:51,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-16 00:23:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 181. [2019-11-16 00:23:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-16 00:23:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 198 transitions. [2019-11-16 00:23:51,249 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 198 transitions. Word has length 44 [2019-11-16 00:23:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:51,249 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 198 transitions. [2019-11-16 00:23:51,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-16 00:23:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 198 transitions. [2019-11-16 00:23:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-16 00:23:51,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:51,250 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:51,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:51,451 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:51,452 INFO L82 PathProgramCache]: Analyzing trace with hash 453331518, now seen corresponding path program 1 times [2019-11-16 00:23:51,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:51,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096007306] [2019-11-16 00:23:51,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:51,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:51,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:51,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096007306] [2019-11-16 00:23:51,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718871954] [2019-11-16 00:23:51,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:52,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-16 00:23:52,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:52,175 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:52,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:23:52,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:52,192 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:23:52,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:52,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-16 00:23:52,334 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:52,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-16 00:23:52,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:52,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:52,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:52,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2019-11-16 00:23:52,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:52,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:52,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:52,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:52,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2019-11-16 00:23:52,528 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:52,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 50 [2019-11-16 00:23:52,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:52,547 INFO L567 ElimStorePlain]: treesize reduction 24, result has 52.0 percent of original size [2019-11-16 00:23:52,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:52,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:26 [2019-11-16 00:23:52,640 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-16 00:23:52,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-11-16 00:23:52,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:52,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:52,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:52,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:52,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-16 00:23:52,663 INFO L567 ElimStorePlain]: treesize reduction 80, result has 28.6 percent of original size [2019-11-16 00:23:52,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:52,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:31 [2019-11-16 00:23:52,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:52,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-11-16 00:23:52,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:52,819 INFO L567 ElimStorePlain]: treesize reduction 12, result has 50.0 percent of original size [2019-11-16 00:23:52,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:52,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:8 [2019-11-16 00:23:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:52,915 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:52,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-11-16 00:23:52,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137947136] [2019-11-16 00:23:52,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-16 00:23:52,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-16 00:23:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:23:52,916 INFO L87 Difference]: Start difference. First operand 181 states and 198 transitions. Second operand 31 states. [2019-11-16 00:23:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:54,977 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2019-11-16 00:23:54,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-16 00:23:54,977 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44 [2019-11-16 00:23:54,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:54,978 INFO L225 Difference]: With dead ends: 197 [2019-11-16 00:23:54,978 INFO L226 Difference]: Without dead ends: 197 [2019-11-16 00:23:54,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=549, Invalid=2421, Unknown=0, NotChecked=0, Total=2970 [2019-11-16 00:23:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-16 00:23:54,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 168. [2019-11-16 00:23:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-16 00:23:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2019-11-16 00:23:54,982 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 44 [2019-11-16 00:23:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:54,982 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2019-11-16 00:23:54,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-16 00:23:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2019-11-16 00:23:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:23:54,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:54,983 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:55,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:55,186 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:23:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash -997117725, now seen corresponding path program 3 times [2019-11-16 00:23:55,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:55,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786299966] [2019-11-16 00:23:55,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:55,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:55,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:55,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786299966] [2019-11-16 00:23:55,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040091600] [2019-11-16 00:23:55,601 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:55,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:23:55,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:23:55,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-16 00:23:55,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:55,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:23:55,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:55,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:55,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:55,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-16 00:23:55,885 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 1=[|v_#valid_91|]} [2019-11-16 00:23:55,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:23:55,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:55,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:55,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:55,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:23:55,916 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:55,943 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-11-16 00:23:55,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:55,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2019-11-16 00:23:55,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:55,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:55,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:56,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:23:56,006 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:56,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,021 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:43 [2019-11-16 00:23:56,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:23:56,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:56,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 44 [2019-11-16 00:23:56,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,184 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.4 percent of original size [2019-11-16 00:23:56,201 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:56,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 45 [2019-11-16 00:23:56,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,242 INFO L567 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-11-16 00:23:56,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:57 [2019-11-16 00:23:56,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:56,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:56,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 78 [2019-11-16 00:23:56,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:56,324 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:56,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 93 [2019-11-16 00:23:56,325 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,460 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-11-16 00:23:56,461 INFO L567 ElimStorePlain]: treesize reduction 34, result has 79.1 percent of original size [2019-11-16 00:23:56,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:56,478 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:56,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2019-11-16 00:23:56,479 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:56,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2019-11-16 00:23:56,485 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,560 INFO L567 ElimStorePlain]: treesize reduction 12, result has 88.3 percent of original size [2019-11-16 00:23:56,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:23:56,560 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:193, output treesize:91 [2019-11-16 00:23:56,593 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_58|], 3=[|v_#valid_92|]} [2019-11-16 00:23:56,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:56,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2019-11-16 00:23:56,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:56,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 65 [2019-11-16 00:23:56,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,729 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-11-16 00:23:56,729 INFO L567 ElimStorePlain]: treesize reduction 12, result has 90.7 percent of original size [2019-11-16 00:23:56,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:56,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2019-11-16 00:23:56,749 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,765 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:56,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 84 [2019-11-16 00:23:56,766 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:56,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:23:56,812 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:131, output treesize:104 [2019-11-16 00:23:56,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:56,892 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_4, v_prenex_6], 6=[|v_#memory_$Pointer$.base_69|, |v_#memory_$Pointer$.offset_53|]} [2019-11-16 00:23:56,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2019-11-16 00:23:56,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:56,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:56,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2019-11-16 00:23:56,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:57,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:57,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:57,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 97 [2019-11-16 00:23:57,035 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:57,131 INFO L567 ElimStorePlain]: treesize reduction 12, result has 91.0 percent of original size [2019-11-16 00:23:57,149 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:57,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 98 [2019-11-16 00:23:57,150 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:57,241 INFO L567 ElimStorePlain]: treesize reduction 24, result has 82.1 percent of original size [2019-11-16 00:23:57,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:23:57,242 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:142, output treesize:116 [2019-11-16 00:23:57,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:57,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:57,500 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_8, v_prenex_9], 6=[|v_#memory_$Pointer$.base_70|, |v_#memory_$Pointer$.offset_54|]} [2019-11-16 00:23:57,521 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:57,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 77 [2019-11-16 00:23:57,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:57,630 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-16 00:23:57,630 INFO L567 ElimStorePlain]: treesize reduction 24, result has 86.7 percent of original size [2019-11-16 00:23:57,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2019-11-16 00:23:57,638 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:57,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:57,752 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:57,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 130 [2019-11-16 00:23:57,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:57,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:57,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:57,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:57,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:57,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:57,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:57,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:57,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:57,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:57,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:57,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:57,761 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:57,900 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-11-16 00:23:57,901 INFO L567 ElimStorePlain]: treesize reduction 56, result has 67.3 percent of original size [2019-11-16 00:23:57,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:23:57,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 70 [2019-11-16 00:23:57,921 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:57,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:57,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:23:57,959 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:168, output treesize:106 [2019-11-16 00:23:58,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,026 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_10], 6=[|v_#memory_$Pointer$.base_71|, v_prenex_11], 12=[|v_#memory_$Pointer$.offset_55|]} [2019-11-16 00:23:58,050 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:58,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 110 [2019-11-16 00:23:58,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:58,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:58,160 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-11-16 00:23:58,160 INFO L567 ElimStorePlain]: treesize reduction 144, result has 63.5 percent of original size [2019-11-16 00:23:58,194 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:58,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 173 [2019-11-16 00:23:58,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:23:58,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,198 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:58,316 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-11-16 00:23:58,317 INFO L567 ElimStorePlain]: treesize reduction 464, result has 31.0 percent of original size [2019-11-16 00:23:58,346 INFO L341 Elim1Store]: treesize reduction 82, result has 28.7 percent of original size [2019-11-16 00:23:58,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 64 [2019-11-16 00:23:58,346 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:58,416 INFO L567 ElimStorePlain]: treesize reduction 14, result has 92.6 percent of original size [2019-11-16 00:23:58,474 INFO L341 Elim1Store]: treesize reduction 174, result has 33.1 percent of original size [2019-11-16 00:23:58,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 148 [2019-11-16 00:23:58,475 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:58,531 INFO L567 ElimStorePlain]: treesize reduction 40, result has 76.7 percent of original size [2019-11-16 00:23:58,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-16 00:23:58,532 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:280, output treesize:132 [2019-11-16 00:23:58,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,719 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_14], 1=[|#memory_$Pointer$.base|], 2=[v_prenex_15], 5=[|#memory_$Pointer$.offset|]} [2019-11-16 00:23:58,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2019-11-16 00:23:58,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:58,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:58,771 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:58,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 57 [2019-11-16 00:23:58,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:58,773 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:58,854 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.5 percent of original size [2019-11-16 00:23:58,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2019-11-16 00:23:58,859 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:58,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:58,910 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:58,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2019-11-16 00:23:58,910 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:58,960 INFO L567 ElimStorePlain]: treesize reduction 12, result has 77.4 percent of original size [2019-11-16 00:23:58,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-16 00:23:58,961 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:142, output treesize:37 [2019-11-16 00:23:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:59,140 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:59,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2019-11-16 00:23:59,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117812763] [2019-11-16 00:23:59,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-16 00:23:59,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:59,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-16 00:23:59,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:23:59,141 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 34 states. [2019-11-16 00:24:00,711 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2019-11-16 00:24:02,048 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 63 [2019-11-16 00:24:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:03,189 INFO L93 Difference]: Finished difference Result 248 states and 266 transitions. [2019-11-16 00:24:03,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:24:03,190 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2019-11-16 00:24:03,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:03,191 INFO L225 Difference]: With dead ends: 248 [2019-11-16 00:24:03,191 INFO L226 Difference]: Without dead ends: 248 [2019-11-16 00:24:03,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=528, Invalid=3012, Unknown=0, NotChecked=0, Total=3540 [2019-11-16 00:24:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-16 00:24:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 190. [2019-11-16 00:24:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-16 00:24:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2019-11-16 00:24:03,194 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 45 [2019-11-16 00:24:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:03,195 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2019-11-16 00:24:03,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-16 00:24:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2019-11-16 00:24:03,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:24:03,195 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:03,195 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:03,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:03,396 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:24:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:03,396 INFO L82 PathProgramCache]: Analyzing trace with hash -997117726, now seen corresponding path program 2 times [2019-11-16 00:24:03,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:03,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246874510] [2019-11-16 00:24:03,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:03,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246874510] [2019-11-16 00:24:03,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131332633] [2019-11-16 00:24:03,721 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:03,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:24:03,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:24:03,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-16 00:24:03,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:03,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:24:03,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:03,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:03,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:03,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:24:03,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:03,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:24:03,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:03,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:03,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:03,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-16 00:24:04,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:04,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:04,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-16 00:24:04,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:04,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-16 00:24:04,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,215 INFO L567 ElimStorePlain]: treesize reduction 24, result has 52.9 percent of original size [2019-11-16 00:24:04,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2019-11-16 00:24:04,269 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-16 00:24:04,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:24:04,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:04,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-11-16 00:24:04,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:04,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:24:04,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:04,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-16 00:24:04,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:04,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:04,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2019-11-16 00:24:04,567 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:04,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 101 [2019-11-16 00:24:04,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:04,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:04,572 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:04,630 INFO L567 ElimStorePlain]: treesize reduction 52, result has 46.9 percent of original size [2019-11-16 00:24:04,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:04,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:44 [2019-11-16 00:24:04,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,774 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:04,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 72 [2019-11-16 00:24:04,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,826 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:04,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 132 [2019-11-16 00:24:04,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:04,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:04,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:04,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:04,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:04,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,863 INFO L567 ElimStorePlain]: treesize reduction 822, result has 2.5 percent of original size [2019-11-16 00:24:04,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,863 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:129, output treesize:21 [2019-11-16 00:24:04,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:24:04,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:04,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:04,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:5 [2019-11-16 00:24:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:04,931 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:04,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2019-11-16 00:24:04,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989525985] [2019-11-16 00:24:04,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-16 00:24:04,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:04,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-16 00:24:04,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:24:04,933 INFO L87 Difference]: Start difference. First operand 190 states and 206 transitions. Second operand 31 states. [2019-11-16 00:24:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:06,816 INFO L93 Difference]: Finished difference Result 237 states and 255 transitions. [2019-11-16 00:24:06,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:24:06,817 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2019-11-16 00:24:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:06,818 INFO L225 Difference]: With dead ends: 237 [2019-11-16 00:24:06,818 INFO L226 Difference]: Without dead ends: 237 [2019-11-16 00:24:06,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=374, Invalid=1976, Unknown=2, NotChecked=0, Total=2352 [2019-11-16 00:24:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-16 00:24:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 175. [2019-11-16 00:24:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-16 00:24:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2019-11-16 00:24:06,822 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 45 [2019-11-16 00:24:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:06,823 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2019-11-16 00:24:06,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-16 00:24:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2019-11-16 00:24:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:24:06,823 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:06,823 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2019-11-16 00:24:07,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:07,025 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:24:07,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:07,025 INFO L82 PathProgramCache]: Analyzing trace with hash -177542858, now seen corresponding path program 2 times [2019-11-16 00:24:07,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:07,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559844381] [2019-11-16 00:24:07,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:07,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:07,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:07,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559844381] [2019-11-16 00:24:07,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396607617] [2019-11-16 00:24:07,441 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:07,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:24:07,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:24:07,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-16 00:24:07,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:07,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:07,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:24:07,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:07,762 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-11-16 00:24:07,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:07,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2019-11-16 00:24:07,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:07,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:07,838 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.0 percent of original size [2019-11-16 00:24:07,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:07,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:07,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:07,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:07,855 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:42 [2019-11-16 00:24:07,988 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:24:07,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:07,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2019-11-16 00:24:07,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,038 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.9 percent of original size [2019-11-16 00:24:08,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:08,046 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:08,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,065 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:56 [2019-11-16 00:24:08,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:08,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2019-11-16 00:24:08,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:08,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:08,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:24:08,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:08,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,180 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-16 00:24:08,181 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_59|], 3=[|v_#valid_97|]} [2019-11-16 00:24:08,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:24:08,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:08,219 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:08,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-16 00:24:08,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:08,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,239 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2019-11-16 00:24:08,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-11-16 00:24:08,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:08,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:08,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,358 INFO L567 ElimStorePlain]: treesize reduction 4, result has 92.7 percent of original size [2019-11-16 00:24:08,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,359 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:56 [2019-11-16 00:24:08,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:08,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:08,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:08,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-16 00:24:08,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:08,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:08,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 104 [2019-11-16 00:24:08,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:08,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:08,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,575 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:08,617 INFO L567 ElimStorePlain]: treesize reduction 56, result has 51.3 percent of original size [2019-11-16 00:24:08,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,617 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:57 [2019-11-16 00:24:08,664 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_83|], 12=[|v_#memory_$Pointer$.offset_61|]} [2019-11-16 00:24:08,696 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:08,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 158 [2019-11-16 00:24:08,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:08,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:08,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:08,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:08,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:08,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-11-16 00:24:08,839 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-11-16 00:24:08,840 INFO L567 ElimStorePlain]: treesize reduction 1125, result has 9.8 percent of original size [2019-11-16 00:24:08,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:08,860 INFO L341 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2019-11-16 00:24:08,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 84 [2019-11-16 00:24:08,861 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:08,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:08,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:08,873 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:164, output treesize:78 [2019-11-16 00:24:09,138 INFO L392 ElimStorePlain]: Different costs {5=[|#memory_$Pointer$.base|], 11=[|#memory_$Pointer$.offset|]} [2019-11-16 00:24:09,151 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-16 00:24:09,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 56 [2019-11-16 00:24:09,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:09,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:09,152 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:09,178 INFO L567 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size [2019-11-16 00:24:09,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:09,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-16 00:24:09,183 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:09,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:09,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:09,191 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:105, output treesize:9 [2019-11-16 00:24:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:09,212 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:09,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2019-11-16 00:24:09,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280618637] [2019-11-16 00:24:09,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-16 00:24:09,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:09,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-16 00:24:09,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1258, Unknown=0, NotChecked=0, Total=1406 [2019-11-16 00:24:09,214 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 38 states. [2019-11-16 00:24:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:11,338 INFO L93 Difference]: Finished difference Result 246 states and 266 transitions. [2019-11-16 00:24:11,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-16 00:24:11,338 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 47 [2019-11-16 00:24:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:11,339 INFO L225 Difference]: With dead ends: 246 [2019-11-16 00:24:11,339 INFO L226 Difference]: Without dead ends: 246 [2019-11-16 00:24:11,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=355, Invalid=2401, Unknown=0, NotChecked=0, Total=2756 [2019-11-16 00:24:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-16 00:24:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 195. [2019-11-16 00:24:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-16 00:24:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2019-11-16 00:24:11,344 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 47 [2019-11-16 00:24:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:11,345 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2019-11-16 00:24:11,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-16 00:24:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2019-11-16 00:24:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:24:11,346 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:11,346 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2019-11-16 00:24:11,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:11,553 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:24:11,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:11,554 INFO L82 PathProgramCache]: Analyzing trace with hash -177542859, now seen corresponding path program 2 times [2019-11-16 00:24:11,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:11,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348925423] [2019-11-16 00:24:11,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:11,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:11,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:11,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348925423] [2019-11-16 00:24:11,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366386418] [2019-11-16 00:24:11,946 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:12,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:24:12,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:24:12,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 67 conjunts are in the unsatisfiable core [2019-11-16 00:24:12,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:12,232 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:12,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:24:12,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,259 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-11-16 00:24:12,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2019-11-16 00:24:12,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:12,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,328 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.0 percent of original size [2019-11-16 00:24:12,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:12,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:12,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,346 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:42 [2019-11-16 00:24:12,479 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:24:12,490 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:12,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2019-11-16 00:24:12,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,531 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.9 percent of original size [2019-11-16 00:24:12,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:12,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:12,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:52 [2019-11-16 00:24:12,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:12,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:24:12,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:12,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:12,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:24:12,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:12,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:52 [2019-11-16 00:24:12,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:12,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-16 00:24:12,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,745 INFO L567 ElimStorePlain]: treesize reduction 28, result has 69.9 percent of original size [2019-11-16 00:24:12,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:65 [2019-11-16 00:24:12,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:12,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:12,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:12,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,880 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2019-11-16 00:24:12,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:12,880 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:87, output treesize:59 [2019-11-16 00:24:13,031 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_66|], 6=[|v_#memory_$Pointer$.base_88|]} [2019-11-16 00:24:13,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:13,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:24:13,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:13,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:13,086 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:13,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 102 [2019-11-16 00:24:13,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:13,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:13,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,091 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:13,138 INFO L567 ElimStorePlain]: treesize reduction 56, result has 52.5 percent of original size [2019-11-16 00:24:13,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:13,138 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:60 [2019-11-16 00:24:13,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:13,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 156 [2019-11-16 00:24:13,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:13,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:13,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:13,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:13,295 INFO L567 ElimStorePlain]: treesize reduction 973, result has 11.4 percent of original size [2019-11-16 00:24:13,304 INFO L341 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2019-11-16 00:24:13,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 70 [2019-11-16 00:24:13,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:13,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:13,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:13,318 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:167, output treesize:81 [2019-11-16 00:24:13,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-16 00:24:13,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:13,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:13,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:13,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:92, output treesize:66 [2019-11-16 00:24:13,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:13,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 33 [2019-11-16 00:24:13,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:13,571 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:13,592 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.5 percent of original size [2019-11-16 00:24:13,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:13,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:28 [2019-11-16 00:24:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:13,727 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:13,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2019-11-16 00:24:13,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463521861] [2019-11-16 00:24:13,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-16 00:24:13,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:13,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-16 00:24:13,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2019-11-16 00:24:13,729 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 41 states. [2019-11-16 00:24:15,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:15,984 INFO L93 Difference]: Finished difference Result 243 states and 263 transitions. [2019-11-16 00:24:15,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:24:15,984 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 47 [2019-11-16 00:24:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:15,986 INFO L225 Difference]: With dead ends: 243 [2019-11-16 00:24:15,986 INFO L226 Difference]: Without dead ends: 243 [2019-11-16 00:24:15,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=551, Invalid=2989, Unknown=0, NotChecked=0, Total=3540 [2019-11-16 00:24:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-16 00:24:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 194. [2019-11-16 00:24:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-16 00:24:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 211 transitions. [2019-11-16 00:24:15,991 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 211 transitions. Word has length 47 [2019-11-16 00:24:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:15,991 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 211 transitions. [2019-11-16 00:24:15,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-16 00:24:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 211 transitions. [2019-11-16 00:24:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:24:15,992 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:15,992 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:16,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:16,196 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:24:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1901872188, now seen corresponding path program 1 times [2019-11-16 00:24:16,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:16,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677318922] [2019-11-16 00:24:16,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:16,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:16,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:16,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677318922] [2019-11-16 00:24:16,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449861489] [2019-11-16 00:24:16,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:16,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 67 conjunts are in the unsatisfiable core [2019-11-16 00:24:16,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:16,837 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:16,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:24:16,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:16,864 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-11-16 00:24:16,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:16,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2019-11-16 00:24:16,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:16,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:16,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:16,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:16,937 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:16,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:16,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:16,951 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2019-11-16 00:24:17,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:17,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:17,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:17,139 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:17,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2019-11-16 00:24:17,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,175 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2019-11-16 00:24:17,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,175 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:52 [2019-11-16 00:24:17,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:17,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:24:17,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:17,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:17,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:24:17,255 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:17,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,273 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:52 [2019-11-16 00:24:17,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:17,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-16 00:24:17,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,359 INFO L567 ElimStorePlain]: treesize reduction 28, result has 70.8 percent of original size [2019-11-16 00:24:17,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:68 [2019-11-16 00:24:17,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:17,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:17,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:17,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,492 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2019-11-16 00:24:17,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,493 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:66 [2019-11-16 00:24:17,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:17,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 109 [2019-11-16 00:24:17,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:17,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:17,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,692 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:17,744 INFO L567 ElimStorePlain]: treesize reduction 56, result has 56.6 percent of original size [2019-11-16 00:24:17,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:17,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-16 00:24:17,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:17,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:71 [2019-11-16 00:24:17,828 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_95|], 12=[|v_#memory_$Pointer$.offset_73|]} [2019-11-16 00:24:17,861 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:17,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 163 [2019-11-16 00:24:17,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:17,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:17,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,919 INFO L567 ElimStorePlain]: treesize reduction 360, result has 27.4 percent of original size [2019-11-16 00:24:17,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:17,930 INFO L341 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2019-11-16 00:24:17,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 84 [2019-11-16 00:24:17,930 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:17,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:17,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:17,948 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:178, output treesize:92 [2019-11-16 00:24:18,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:18,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2019-11-16 00:24:18,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:18,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:18,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:18,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:103, output treesize:66 [2019-11-16 00:24:18,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:18,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 33 [2019-11-16 00:24:18,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:18,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:18,204 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:18,234 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.5 percent of original size [2019-11-16 00:24:18,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:18,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:28 [2019-11-16 00:24:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:18,346 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:18,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2019-11-16 00:24:18,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493127469] [2019-11-16 00:24:18,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-16 00:24:18,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-16 00:24:18,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1443, Unknown=0, NotChecked=0, Total=1640 [2019-11-16 00:24:18,347 INFO L87 Difference]: Start difference. First operand 194 states and 211 transitions. Second operand 41 states. [2019-11-16 00:24:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:20,898 INFO L93 Difference]: Finished difference Result 242 states and 262 transitions. [2019-11-16 00:24:20,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-16 00:24:20,898 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 48 [2019-11-16 00:24:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:20,900 INFO L225 Difference]: With dead ends: 242 [2019-11-16 00:24:20,900 INFO L226 Difference]: Without dead ends: 242 [2019-11-16 00:24:20,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=529, Invalid=2893, Unknown=0, NotChecked=0, Total=3422 [2019-11-16 00:24:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-16 00:24:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 199. [2019-11-16 00:24:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-16 00:24:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 217 transitions. [2019-11-16 00:24:20,905 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 217 transitions. Word has length 48 [2019-11-16 00:24:20,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:20,906 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 217 transitions. [2019-11-16 00:24:20,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-16 00:24:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 217 transitions. [2019-11-16 00:24:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:24:20,907 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:20,907 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:21,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:21,110 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:24:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1901872189, now seen corresponding path program 1 times [2019-11-16 00:24:21,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:21,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844663156] [2019-11-16 00:24:21,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:21,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:21,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:21,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844663156] [2019-11-16 00:24:21,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737573893] [2019-11-16 00:24:21,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:21,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-16 00:24:21,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:21,779 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:21,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:24:21,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:21,803 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-16 00:24:21,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:21,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-16 00:24:21,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:21,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:21,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:21,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:21,858 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:21,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:21,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:21,871 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-16 00:24:22,004 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:22,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-16 00:24:22,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,039 INFO L567 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-11-16 00:24:22,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:22,042 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:22,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,057 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:53 [2019-11-16 00:24:22,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:22,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2019-11-16 00:24:22,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:22,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:22,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:24:22,132 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:22,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:49 [2019-11-16 00:24:22,181 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_60|], 3=[|v_#valid_103|]} [2019-11-16 00:24:22,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:24:22,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:22,252 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:22,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-16 00:24:22,253 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:22,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,275 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2019-11-16 00:24:22,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-11-16 00:24:22,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:22,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:22,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:22,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,421 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:57 [2019-11-16 00:24:22,677 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:22,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 112 [2019-11-16 00:24:22,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:22,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:22,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,683 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:22,748 INFO L567 ElimStorePlain]: treesize reduction 60, result has 51.6 percent of original size [2019-11-16 00:24:22,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-16 00:24:22,752 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:22,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:22,785 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:62 [2019-11-16 00:24:22,853 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_101|], 12=[|v_#memory_$Pointer$.offset_79|]} [2019-11-16 00:24:22,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:22,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 166 [2019-11-16 00:24:22,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:22,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:22,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:22,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:22,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-11-16 00:24:23,009 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2019-11-16 00:24:23,009 INFO L567 ElimStorePlain]: treesize reduction 1225, result has 9.4 percent of original size [2019-11-16 00:24:23,020 INFO L341 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2019-11-16 00:24:23,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 92 [2019-11-16 00:24:23,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:23,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:23,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:23,033 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:169, output treesize:83 [2019-11-16 00:24:23,268 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.base|], 12=[|#memory_$Pointer$.offset|]} [2019-11-16 00:24:23,291 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:23,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 80 [2019-11-16 00:24:23,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:23,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:23,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:23,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:23,293 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:23,322 INFO L567 ElimStorePlain]: treesize reduction 28, result has 64.1 percent of original size [2019-11-16 00:24:23,336 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:23,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-16 00:24:23,337 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:23,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:23,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:23,355 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:113, output treesize:9 [2019-11-16 00:24:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:23,371 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:23,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-11-16 00:24:23,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494723656] [2019-11-16 00:24:23,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-16 00:24:23,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:23,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-16 00:24:23,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2019-11-16 00:24:23,372 INFO L87 Difference]: Start difference. First operand 199 states and 217 transitions. Second operand 37 states. [2019-11-16 00:24:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:25,206 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2019-11-16 00:24:25,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:24:25,207 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 48 [2019-11-16 00:24:25,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:25,208 INFO L225 Difference]: With dead ends: 245 [2019-11-16 00:24:25,208 INFO L226 Difference]: Without dead ends: 245 [2019-11-16 00:24:25,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=302, Invalid=2248, Unknown=0, NotChecked=0, Total=2550 [2019-11-16 00:24:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-16 00:24:25,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2019-11-16 00:24:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-16 00:24:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2019-11-16 00:24:25,213 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 48 [2019-11-16 00:24:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:25,213 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2019-11-16 00:24:25,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-16 00:24:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2019-11-16 00:24:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:24:25,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:25,214 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:25,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:25,415 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:24:25,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:25,415 INFO L82 PathProgramCache]: Analyzing trace with hash -567890553, now seen corresponding path program 1 times [2019-11-16 00:24:25,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:25,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643442943] [2019-11-16 00:24:25,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:25,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:25,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:26,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643442943] [2019-11-16 00:24:26,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338335205] [2019-11-16 00:24:26,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:26,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-16 00:24:26,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:26,371 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:26,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:24:26,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:26,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:26,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:26,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-16 00:24:26,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:26,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:26,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:26,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:26,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-16 00:24:26,506 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:26,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-16 00:24:26,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:26,532 INFO L567 ElimStorePlain]: treesize reduction 24, result has 47.8 percent of original size [2019-11-16 00:24:26,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:26,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2019-11-16 00:24:26,585 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:26,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 64 [2019-11-16 00:24:26,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:26,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:26,594 INFO L567 ElimStorePlain]: treesize reduction 32, result has 27.3 percent of original size [2019-11-16 00:24:26,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:26,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:12 [2019-11-16 00:24:26,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:24:26,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:26,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:26,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:26,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2019-11-16 00:24:26,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:26,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 32 [2019-11-16 00:24:26,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:26,805 INFO L567 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-11-16 00:24:26,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:26,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-11-16 00:24:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:26,843 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:26,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 34 [2019-11-16 00:24:26,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56957861] [2019-11-16 00:24:26,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-16 00:24:26,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:26,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-16 00:24:26,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2019-11-16 00:24:26,844 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand 35 states. [2019-11-16 00:24:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:28,617 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2019-11-16 00:24:28,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-16 00:24:28,617 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 50 [2019-11-16 00:24:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:28,618 INFO L225 Difference]: With dead ends: 233 [2019-11-16 00:24:28,618 INFO L226 Difference]: Without dead ends: 233 [2019-11-16 00:24:28,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=414, Invalid=2448, Unknown=0, NotChecked=0, Total=2862 [2019-11-16 00:24:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-16 00:24:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 211. [2019-11-16 00:24:28,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-16 00:24:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 230 transitions. [2019-11-16 00:24:28,622 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 230 transitions. Word has length 50 [2019-11-16 00:24:28,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:28,623 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 230 transitions. [2019-11-16 00:24:28,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-16 00:24:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 230 transitions. [2019-11-16 00:24:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:24:28,624 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:28,624 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:28,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:28,827 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:24:28,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash -567890552, now seen corresponding path program 1 times [2019-11-16 00:24:28,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:28,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259638923] [2019-11-16 00:24:28,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:28,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:28,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:29,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259638923] [2019-11-16 00:24:29,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928706167] [2019-11-16 00:24:29,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:29,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-16 00:24:29,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:29,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-16 00:24:29,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:29,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:29,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-11-16 00:24:29,398 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:29,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:29,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:29,403 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:16 [2019-11-16 00:24:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:24:29,503 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:29,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 26 [2019-11-16 00:24:29,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043643352] [2019-11-16 00:24:29,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-16 00:24:29,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:29,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-16 00:24:29,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:24:29,504 INFO L87 Difference]: Start difference. First operand 211 states and 230 transitions. Second operand 27 states. [2019-11-16 00:24:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:31,287 INFO L93 Difference]: Finished difference Result 251 states and 271 transitions. [2019-11-16 00:24:31,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-16 00:24:31,287 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2019-11-16 00:24:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:31,288 INFO L225 Difference]: With dead ends: 251 [2019-11-16 00:24:31,288 INFO L226 Difference]: Without dead ends: 251 [2019-11-16 00:24:31,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=511, Invalid=2459, Unknown=0, NotChecked=0, Total=2970 [2019-11-16 00:24:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-16 00:24:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 219. [2019-11-16 00:24:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-16 00:24:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 239 transitions. [2019-11-16 00:24:31,293 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 239 transitions. Word has length 50 [2019-11-16 00:24:31,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:31,294 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 239 transitions. [2019-11-16 00:24:31,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-16 00:24:31,294 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 239 transitions. [2019-11-16 00:24:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:24:31,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:31,295 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-16 00:24:31,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:31,498 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:24:31,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:31,499 INFO L82 PathProgramCache]: Analyzing trace with hash -546229408, now seen corresponding path program 4 times [2019-11-16 00:24:31,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:31,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910540955] [2019-11-16 00:24:31,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:31,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:31,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:31,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910540955] [2019-11-16 00:24:31,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721926962] [2019-11-16 00:24:31,876 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:32,032 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:24:32,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:24:32,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-16 00:24:32,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:32,138 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:24:32,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,162 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-16 00:24:32,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-16 00:24:32,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:32,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:32,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,228 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-16 00:24:32,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:32,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:32,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-16 00:24:32,382 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,414 INFO L567 ElimStorePlain]: treesize reduction 24, result has 68.8 percent of original size [2019-11-16 00:24:32,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,414 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:53 [2019-11-16 00:24:32,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:32,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2019-11-16 00:24:32,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:32,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:24:32,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,504 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:49 [2019-11-16 00:24:32,540 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_61|], 3=[|v_#valid_107|]} [2019-11-16 00:24:32,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:24:32,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-16 00:24:32,576 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,593 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2019-11-16 00:24:32,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:32,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-11-16 00:24:32,689 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:32,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:57 [2019-11-16 00:24:32,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:32,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 112 [2019-11-16 00:24:32,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:32,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:32,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:32,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:32,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:32,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:32,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:32,979 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:33,025 INFO L567 ElimStorePlain]: treesize reduction 60, result has 51.6 percent of original size [2019-11-16 00:24:33,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-16 00:24:33,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,045 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:62 [2019-11-16 00:24:33,091 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_110|], 12=[|v_#memory_$Pointer$.offset_85|]} [2019-11-16 00:24:33,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 166 [2019-11-16 00:24:33,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:33,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:33,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:33,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-11-16 00:24:33,234 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2019-11-16 00:24:33,234 INFO L567 ElimStorePlain]: treesize reduction 1225, result has 9.4 percent of original size [2019-11-16 00:24:33,244 INFO L341 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2019-11-16 00:24:33,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 92 [2019-11-16 00:24:33,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:33,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:169, output treesize:83 [2019-11-16 00:24:33,483 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.base|], 12=[|#memory_$Pointer$.offset|]} [2019-11-16 00:24:33,499 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 80 [2019-11-16 00:24:33,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,501 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:33,528 INFO L567 ElimStorePlain]: treesize reduction 28, result has 64.1 percent of original size [2019-11-16 00:24:33,533 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-16 00:24:33,534 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,541 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:113, output treesize:9 [2019-11-16 00:24:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:33,558 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:33,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-11-16 00:24:33,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253732896] [2019-11-16 00:24:33,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-16 00:24:33,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:33,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-16 00:24:33,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2019-11-16 00:24:33,559 INFO L87 Difference]: Start difference. First operand 219 states and 239 transitions. Second operand 37 states. [2019-11-16 00:24:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:36,429 INFO L93 Difference]: Finished difference Result 282 states and 307 transitions. [2019-11-16 00:24:36,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:24:36,429 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 50 [2019-11-16 00:24:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:36,430 INFO L225 Difference]: With dead ends: 282 [2019-11-16 00:24:36,430 INFO L226 Difference]: Without dead ends: 282 [2019-11-16 00:24:36,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=302, Invalid=2248, Unknown=0, NotChecked=0, Total=2550 [2019-11-16 00:24:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-16 00:24:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 225. [2019-11-16 00:24:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-16 00:24:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 248 transitions. [2019-11-16 00:24:36,435 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 248 transitions. Word has length 50 [2019-11-16 00:24:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:36,435 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 248 transitions. [2019-11-16 00:24:36,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-16 00:24:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 248 transitions. [2019-11-16 00:24:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:24:36,435 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:36,436 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-16 00:24:36,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:36,636 INFO L410 AbstractCegarLoop]: === Iteration 37 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:24:36,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:36,637 INFO L82 PathProgramCache]: Analyzing trace with hash -546229409, now seen corresponding path program 3 times [2019-11-16 00:24:36,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:36,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984010169] [2019-11-16 00:24:36,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:36,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:36,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:36,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984010169] [2019-11-16 00:24:36,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607220094] [2019-11-16 00:24:36,966 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:37,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:24:37,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:24:37,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 76 conjunts are in the unsatisfiable core [2019-11-16 00:24:37,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:37,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:24:37,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2019-11-16 00:24:37,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:37,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:37,314 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,325 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-11-16 00:24:37,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:24:37,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 39 [2019-11-16 00:24:37,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,474 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.1 percent of original size [2019-11-16 00:24:37,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 45 [2019-11-16 00:24:37,491 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,523 INFO L567 ElimStorePlain]: treesize reduction 24, result has 66.2 percent of original size [2019-11-16 00:24:37,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,524 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:47 [2019-11-16 00:24:37,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 61 [2019-11-16 00:24:37,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 76 [2019-11-16 00:24:37,590 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,676 INFO L567 ElimStorePlain]: treesize reduction 11, result has 91.5 percent of original size [2019-11-16 00:24:37,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,690 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2019-11-16 00:24:37,691 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2019-11-16 00:24:37,699 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,758 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.6 percent of original size [2019-11-16 00:24:37,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:24:37,759 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:159, output treesize:76 [2019-11-16 00:24:37,794 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_62|], 3=[|v_#valid_109|]} [2019-11-16 00:24:37,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2019-11-16 00:24:37,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2019-11-16 00:24:37,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,915 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-11-16 00:24:37,916 INFO L567 ElimStorePlain]: treesize reduction 3, result has 97.5 percent of original size [2019-11-16 00:24:37,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 77 [2019-11-16 00:24:37,937 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 84 [2019-11-16 00:24:37,955 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:38,058 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-16 00:24:38,058 INFO L567 ElimStorePlain]: treesize reduction 28, result has 80.3 percent of original size [2019-11-16 00:24:38,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:24:38,059 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:114 [2019-11-16 00:24:38,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:38,154 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_114|], 6=[v_prenex_19, |v_#memory_$Pointer$.offset_89|, v_prenex_18]} [2019-11-16 00:24:38,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2019-11-16 00:24:38,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:38,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:38,243 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:38,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 98 [2019-11-16 00:24:38,243 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:38,348 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-16 00:24:38,349 INFO L567 ElimStorePlain]: treesize reduction 24, result has 84.4 percent of original size [2019-11-16 00:24:38,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2019-11-16 00:24:38,354 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:38,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:38,416 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:38,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 87 [2019-11-16 00:24:38,417 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:38,518 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-16 00:24:38,518 INFO L567 ElimStorePlain]: treesize reduction 12, result has 90.6 percent of original size [2019-11-16 00:24:38,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:24:38,519 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:152, output treesize:126 [2019-11-16 00:24:38,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:38,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:38,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2019-11-16 00:24:38,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:38,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:38,842 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:38,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 141 [2019-11-16 00:24:38,843 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:38,948 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-11-16 00:24:38,948 INFO L567 ElimStorePlain]: treesize reduction 30, result has 86.1 percent of original size [2019-11-16 00:24:38,955 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:24:38,965 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:38,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 80 [2019-11-16 00:24:38,966 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:38,992 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:38,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 117 [2019-11-16 00:24:38,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:38,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:38,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:38,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:38,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:38,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:38,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:38,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:38,995 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:39,105 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-16 00:24:39,106 INFO L567 ElimStorePlain]: treesize reduction 52, result has 72.5 percent of original size [2019-11-16 00:24:39,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:39,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-16 00:24:39,106 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:208, output treesize:137 [2019-11-16 00:24:39,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:39,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:39,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:39,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:39,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:39,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:39,377 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:24:39,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 83 [2019-11-16 00:24:39,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:39,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:39,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 183 [2019-11-16 00:24:39,461 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:39,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:39,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 174 [2019-11-16 00:24:39,476 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:39,683 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-11-16 00:24:39,683 INFO L567 ElimStorePlain]: treesize reduction 107, result has 75.5 percent of original size [2019-11-16 00:24:39,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 60 [2019-11-16 00:24:39,695 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:39,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:39,711 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:39,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 99 [2019-11-16 00:24:39,712 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:39,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:39,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 112 [2019-11-16 00:24:39,727 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:39,842 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-11-16 00:24:39,842 INFO L567 ElimStorePlain]: treesize reduction 100, result has 70.2 percent of original size [2019-11-16 00:24:39,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-11-16 00:24:39,843 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:462, output treesize:236 [2019-11-16 00:24:40,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:40,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:40,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2019-11-16 00:24:40,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:40,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 89 [2019-11-16 00:24:40,581 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:40,655 INFO L567 ElimStorePlain]: treesize reduction 27, result has 86.0 percent of original size [2019-11-16 00:24:40,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-16 00:24:40,656 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:226, output treesize:166 [2019-11-16 00:24:40,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:40,760 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:24:40,771 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:40,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 93 [2019-11-16 00:24:40,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:40,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:40,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:40,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:40,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:40,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:40,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:40,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:40,774 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:40,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:40,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 71 [2019-11-16 00:24:40,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:40,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:40,784 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:40,881 INFO L567 ElimStorePlain]: treesize reduction 30, result has 79.6 percent of original size [2019-11-16 00:24:40,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:40,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 53 [2019-11-16 00:24:40,896 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:40,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 37 [2019-11-16 00:24:40,899 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:40,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:40,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-16 00:24:40,923 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:220, output treesize:54 [2019-11-16 00:24:41,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:41,152 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:41,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 42 [2019-11-16 00:24:41,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830882156] [2019-11-16 00:24:41,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-16 00:24:41,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:41,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-16 00:24:41,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1651, Unknown=0, NotChecked=0, Total=1806 [2019-11-16 00:24:41,153 INFO L87 Difference]: Start difference. First operand 225 states and 248 transitions. Second operand 43 states. [2019-11-16 00:24:42,816 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 53 [2019-11-16 00:24:43,811 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 92 [2019-11-16 00:24:44,603 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 165 [2019-11-16 00:24:44,927 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 151 [2019-11-16 00:24:45,306 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 161 [2019-11-16 00:24:45,624 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 137 [2019-11-16 00:24:46,353 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 201 [2019-11-16 00:24:46,574 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-11-16 00:24:46,954 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 157 [2019-11-16 00:24:47,355 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 143 [2019-11-16 00:24:47,694 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-11-16 00:24:48,375 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 196 [2019-11-16 00:24:48,849 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 155 [2019-11-16 00:24:49,328 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 147 [2019-11-16 00:24:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:49,764 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2019-11-16 00:24:49,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-16 00:24:49,764 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 50 [2019-11-16 00:24:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:49,766 INFO L225 Difference]: With dead ends: 289 [2019-11-16 00:24:49,766 INFO L226 Difference]: Without dead ends: 289 [2019-11-16 00:24:49,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=837, Invalid=5169, Unknown=0, NotChecked=0, Total=6006 [2019-11-16 00:24:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-16 00:24:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 232. [2019-11-16 00:24:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-16 00:24:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 259 transitions. [2019-11-16 00:24:49,769 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 259 transitions. Word has length 50 [2019-11-16 00:24:49,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:49,769 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 259 transitions. [2019-11-16 00:24:49,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-16 00:24:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 259 transitions. [2019-11-16 00:24:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:24:49,770 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:49,770 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2019-11-16 00:24:49,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:49,971 INFO L410 AbstractCegarLoop]: === Iteration 38 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:24:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:49,971 INFO L82 PathProgramCache]: Analyzing trace with hash -937476270, now seen corresponding path program 2 times [2019-11-16 00:24:49,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:49,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466772624] [2019-11-16 00:24:49,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:49,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:49,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:50,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466772624] [2019-11-16 00:24:50,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296790238] [2019-11-16 00:24:50,470 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:50,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:24:50,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:24:50,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-16 00:24:50,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:50,848 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:50,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:24:50,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:50,891 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-16 00:24:50,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:50,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-16 00:24:50,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:50,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:50,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:50,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:50,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:50,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:50,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:50,997 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:35 [2019-11-16 00:24:51,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:51,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:24:51,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:51,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:51,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-16 00:24:51,162 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,195 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2019-11-16 00:24:51,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,195 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2019-11-16 00:24:51,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:51,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:24:51,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:51,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:51,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:24:51,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:51,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-16 00:24:51,313 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:51,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-16 00:24:51,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,362 INFO L567 ElimStorePlain]: treesize reduction 28, result has 68.9 percent of original size [2019-11-16 00:24:51,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:62 [2019-11-16 00:24:51,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:51,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:51,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:51,450 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:51,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,470 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:60 [2019-11-16 00:24:51,622 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_96|], 6=[|v_#memory_$Pointer$.base_121|]} [2019-11-16 00:24:51,639 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:51,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 91 [2019-11-16 00:24:51,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:51,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:51,640 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:51,685 INFO L567 ElimStorePlain]: treesize reduction 24, result has 81.1 percent of original size [2019-11-16 00:24:51,725 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:51,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 110 [2019-11-16 00:24:51,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:51,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:51,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:51,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:51,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:51,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:51,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:51,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:51,728 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:51,780 INFO L567 ElimStorePlain]: treesize reduction 60, result has 52.4 percent of original size [2019-11-16 00:24:51,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,781 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:116, output treesize:65 [2019-11-16 00:24:51,871 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:51,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 200 treesize of output 184 [2019-11-16 00:24:51,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:51,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:51,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,917 INFO L567 ElimStorePlain]: treesize reduction 148, result has 50.8 percent of original size [2019-11-16 00:24:51,954 INFO L341 Elim1Store]: treesize reduction 46, result has 55.3 percent of original size [2019-11-16 00:24:51,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 135 [2019-11-16 00:24:51,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:51,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:51,990 INFO L567 ElimStorePlain]: treesize reduction 48, result has 67.1 percent of original size [2019-11-16 00:24:51,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:51,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:208, output treesize:98 [2019-11-16 00:24:52,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:52,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 71 [2019-11-16 00:24:52,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:52,140 INFO L567 ElimStorePlain]: treesize reduction 20, result has 78.0 percent of original size [2019-11-16 00:24:52,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:52,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:109, output treesize:71 [2019-11-16 00:24:52,260 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:52,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 41 [2019-11-16 00:24:52,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:52,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:52,261 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:52,280 INFO L567 ElimStorePlain]: treesize reduction 12, result has 70.0 percent of original size [2019-11-16 00:24:52,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:52,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:75, output treesize:28 [2019-11-16 00:24:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:52,391 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:52,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2019-11-16 00:24:52,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120745206] [2019-11-16 00:24:52,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-16 00:24:52,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:52,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-16 00:24:52,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1443, Unknown=0, NotChecked=0, Total=1640 [2019-11-16 00:24:52,392 INFO L87 Difference]: Start difference. First operand 232 states and 259 transitions. Second operand 41 states. [2019-11-16 00:24:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:54,579 INFO L93 Difference]: Finished difference Result 283 states and 312 transitions. [2019-11-16 00:24:54,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-16 00:24:54,579 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 51 [2019-11-16 00:24:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:54,580 INFO L225 Difference]: With dead ends: 283 [2019-11-16 00:24:54,580 INFO L226 Difference]: Without dead ends: 283 [2019-11-16 00:24:54,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=529, Invalid=2893, Unknown=0, NotChecked=0, Total=3422 [2019-11-16 00:24:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-16 00:24:54,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 237. [2019-11-16 00:24:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-16 00:24:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2019-11-16 00:24:54,584 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 51 [2019-11-16 00:24:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:54,584 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2019-11-16 00:24:54,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-16 00:24:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2019-11-16 00:24:54,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:24:54,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:54,585 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2019-11-16 00:24:54,785 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:54,786 INFO L410 AbstractCegarLoop]: === Iteration 39 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:24:54,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:54,786 INFO L82 PathProgramCache]: Analyzing trace with hash -937476269, now seen corresponding path program 1 times [2019-11-16 00:24:54,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:54,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13890728] [2019-11-16 00:24:54,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:54,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:54,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:55,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13890728] [2019-11-16 00:24:55,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052154088] [2019-11-16 00:24:55,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:55,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-16 00:24:55,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:55,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:55,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:24:55,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:55,599 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-16 00:24:55,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:55,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-16 00:24:55,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:55,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:55,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:55,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:55,653 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:55,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:55,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:55,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-16 00:24:55,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:55,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-16 00:24:55,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:55,835 INFO L567 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-11-16 00:24:55,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:55,838 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:55,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:55,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:55,857 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:49 [2019-11-16 00:24:55,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:55,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:24:55,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:55,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:55,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:55,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:24:55,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:55,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:55,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:55,947 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-16 00:24:55,948 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_63|], 3=[|v_#valid_113|]} [2019-11-16 00:24:55,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:24:55,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:55,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:55,983 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:55,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-16 00:24:55,984 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:56,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:56,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:56,002 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:55 [2019-11-16 00:24:56,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:56,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:56,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:56,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:56,078 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:56,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:56,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:56,094 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:57 [2019-11-16 00:24:56,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:56,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:56,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-16 00:24:56,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:56,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:56,284 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:56,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 112 [2019-11-16 00:24:56,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:56,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:56,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,288 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:56,333 INFO L567 ElimStorePlain]: treesize reduction 60, result has 50.0 percent of original size [2019-11-16 00:24:56,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:56,333 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:62 [2019-11-16 00:24:56,381 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_128|], 12=[|v_#memory_$Pointer$.offset_103|]} [2019-11-16 00:24:56,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:56,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 166 [2019-11-16 00:24:56,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:56,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:56,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:56,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:56,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-11-16 00:24:56,502 INFO L567 ElimStorePlain]: treesize reduction 1369, result has 8.5 percent of original size [2019-11-16 00:24:56,515 INFO L341 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2019-11-16 00:24:56,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 92 [2019-11-16 00:24:56,516 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:56,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:56,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:56,528 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:169, output treesize:83 [2019-11-16 00:24:56,766 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.base|], 12=[|#memory_$Pointer$.offset|]} [2019-11-16 00:24:56,784 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:56,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 80 [2019-11-16 00:24:56,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:56,786 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:56,813 INFO L567 ElimStorePlain]: treesize reduction 28, result has 64.1 percent of original size [2019-11-16 00:24:56,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:56,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-16 00:24:56,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:56,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:56,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:56,827 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:113, output treesize:9 [2019-11-16 00:24:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:56,844 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:56,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-11-16 00:24:56,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144962217] [2019-11-16 00:24:56,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-16 00:24:56,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:56,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-16 00:24:56,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2019-11-16 00:24:56,845 INFO L87 Difference]: Start difference. First operand 237 states and 265 transitions. Second operand 37 states. [2019-11-16 00:24:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:58,946 INFO L93 Difference]: Finished difference Result 286 states and 315 transitions. [2019-11-16 00:24:58,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:24:58,947 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 51 [2019-11-16 00:24:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:58,948 INFO L225 Difference]: With dead ends: 286 [2019-11-16 00:24:58,948 INFO L226 Difference]: Without dead ends: 286 [2019-11-16 00:24:58,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=302, Invalid=2248, Unknown=0, NotChecked=0, Total=2550 [2019-11-16 00:24:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-16 00:24:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2019-11-16 00:24:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-16 00:24:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 259 transitions. [2019-11-16 00:24:58,956 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 259 transitions. Word has length 51 [2019-11-16 00:24:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:58,956 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 259 transitions. [2019-11-16 00:24:58,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-16 00:24:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 259 transitions. [2019-11-16 00:24:58,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:24:58,957 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:58,957 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:59,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:59,161 INFO L410 AbstractCegarLoop]: === Iteration 40 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:24:59,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:59,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1554054140, now seen corresponding path program 1 times [2019-11-16 00:24:59,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:59,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417043483] [2019-11-16 00:24:59,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:59,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:59,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:59,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417043483] [2019-11-16 00:24:59,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086998956] [2019-11-16 00:24:59,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:59,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-16 00:24:59,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:00,066 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:25:00,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,089 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-16 00:25:00,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-16 00:25:00,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:00,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,175 INFO L567 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2019-11-16 00:25:00,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:00,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,190 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-11-16 00:25:00,308 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-16 00:25:00,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,343 INFO L567 ElimStorePlain]: treesize reduction 24, result has 68.8 percent of original size [2019-11-16 00:25:00,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:25:00,346 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,361 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2019-11-16 00:25:00,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:00,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:25:00,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:00,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:25:00,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,452 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-16 00:25:00,500 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_64|], 6=[|v_#valid_115|]} [2019-11-16 00:25:00,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:00,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-16 00:25:00,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,558 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-16 00:25:00,559 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,618 INFO L567 ElimStorePlain]: treesize reduction 28, result has 72.5 percent of original size [2019-11-16 00:25:00,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:74 [2019-11-16 00:25:00,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:00,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:00,741 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:96, output treesize:76 [2019-11-16 00:25:00,927 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_108|], 6=[|v_#memory_$Pointer$.base_133|]} [2019-11-16 00:25:00,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:00,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:25:00,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:00,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,996 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 122 [2019-11-16 00:25:00,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:00,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:00,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,000 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:01,067 INFO L567 ElimStorePlain]: treesize reduction 60, result has 57.4 percent of original size [2019-11-16 00:25:01,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:01,067 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:134, output treesize:94 [2019-11-16 00:25:01,140 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_109|], 12=[|v_#memory_$Pointer$.base_134|]} [2019-11-16 00:25:01,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:01,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:25:01,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:01,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:01,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:01,264 INFO L341 Elim1Store]: treesize reduction 24, result has 63.6 percent of original size [2019-11-16 00:25:01,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 85 [2019-11-16 00:25:01,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:01,342 INFO L567 ElimStorePlain]: treesize reduction 50, result has 65.3 percent of original size [2019-11-16 00:25:01,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:01,342 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:94 [2019-11-16 00:25:01,344 INFO L392 ElimStorePlain]: Different costs {3=[|v_#length_65|], 6=[|v_#valid_116|]} [2019-11-16 00:25:01,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:01,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:01,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-11-16 00:25:01,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:01,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:01,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:01,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 41 [2019-11-16 00:25:01,400 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:01,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:01,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:01,428 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:96 [2019-11-16 00:25:01,496 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_110|], 12=[|v_#memory_$Pointer$.base_135|]} [2019-11-16 00:25:01,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:01,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:01,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:01,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:01,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 98 [2019-11-16 00:25:01,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:01,625 INFO L567 ElimStorePlain]: treesize reduction 72, result has 57.1 percent of original size [2019-11-16 00:25:01,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:01,626 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:118, output treesize:98 [2019-11-16 00:25:01,817 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_111|], 12=[|v_#memory_$Pointer$.base_136|]} [2019-11-16 00:25:01,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:01,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:25:01,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:01,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:01,916 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:01,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 187 [2019-11-16 00:25:01,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:01,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:01,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:01,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:01,945 INFO L496 ElimStorePlain]: Start of recursive call 3: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:02,522 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 217 [2019-11-16 00:25:02,522 INFO L567 ElimStorePlain]: treesize reduction 461, result has 57.6 percent of original size [2019-11-16 00:25:02,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:25:02,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:02,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:02,527 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:185, output treesize:909 [2019-11-16 00:25:02,750 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_112|], 12=[|v_#memory_$Pointer$.base_137|]} [2019-11-16 00:25:02,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:02,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 33 [2019-11-16 00:25:02,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:02,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:02,854 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:02,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 212 treesize of output 232 [2019-11-16 00:25:02,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:02,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:02,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:02,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:02,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:02,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:02,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:02,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:02,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:02,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:02,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:02,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:02,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:02,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-16 00:25:02,963 INFO L567 ElimStorePlain]: treesize reduction 970, result has 14.8 percent of original size [2019-11-16 00:25:02,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:02,964 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:277, output treesize:167 [2019-11-16 00:25:03,098 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-16 00:25:03,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2019-11-16 00:25:03,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:03,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:03,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:03,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 87 [2019-11-16 00:25:03,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:03,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:03,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:03,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:03,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:03,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:03,143 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:03,184 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-11-16 00:25:03,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:03,185 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:181, output treesize:31 [2019-11-16 00:25:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:03,308 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:03,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2019-11-16 00:25:03,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696849455] [2019-11-16 00:25:03,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-16 00:25:03,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-16 00:25:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1984, Unknown=0, NotChecked=0, Total=2162 [2019-11-16 00:25:03,309 INFO L87 Difference]: Start difference. First operand 232 states and 259 transitions. Second operand 47 states. [2019-11-16 00:25:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:11,026 INFO L93 Difference]: Finished difference Result 366 states and 402 transitions. [2019-11-16 00:25:11,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-11-16 00:25:11,027 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 51 [2019-11-16 00:25:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:11,028 INFO L225 Difference]: With dead ends: 366 [2019-11-16 00:25:11,028 INFO L226 Difference]: Without dead ends: 366 [2019-11-16 00:25:11,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2476 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1239, Invalid=7691, Unknown=0, NotChecked=0, Total=8930 [2019-11-16 00:25:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-16 00:25:11,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 254. [2019-11-16 00:25:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-16 00:25:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 284 transitions. [2019-11-16 00:25:11,034 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 284 transitions. Word has length 51 [2019-11-16 00:25:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:11,034 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 284 transitions. [2019-11-16 00:25:11,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-16 00:25:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 284 transitions. [2019-11-16 00:25:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:25:11,035 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:11,035 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:11,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:11,239 INFO L410 AbstractCegarLoop]: === Iteration 41 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:25:11,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:11,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1554054139, now seen corresponding path program 1 times [2019-11-16 00:25:11,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:11,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672504412] [2019-11-16 00:25:11,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:11,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:11,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:11,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672504412] [2019-11-16 00:25:11,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157206736] [2019-11-16 00:25:11,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:12,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-16 00:25:12,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:12,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:12,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:12,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:12,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:12,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,156 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-11-16 00:25:12,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-16 00:25:12,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:12,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-11-16 00:25:12,266 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:12,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-16 00:25:12,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,287 INFO L567 ElimStorePlain]: treesize reduction 12, result has 71.4 percent of original size [2019-11-16 00:25:12,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2019-11-16 00:25:12,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:12,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:12,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:12,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 40 [2019-11-16 00:25:12,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:12,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-16 00:25:12,346 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,385 INFO L567 ElimStorePlain]: treesize reduction 8, result has 86.0 percent of original size [2019-11-16 00:25:12,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:25:12,385 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:49 [2019-11-16 00:25:12,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:12,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 59 [2019-11-16 00:25:12,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,454 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:12,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 55 [2019-11-16 00:25:12,454 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,513 INFO L567 ElimStorePlain]: treesize reduction 28, result has 70.5 percent of original size [2019-11-16 00:25:12,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:25:12,514 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:67 [2019-11-16 00:25:12,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:12,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2019-11-16 00:25:12,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,600 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:12,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 70 [2019-11-16 00:25:12,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,664 INFO L567 ElimStorePlain]: treesize reduction 29, result has 71.3 percent of original size [2019-11-16 00:25:12,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:25:12,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:74 [2019-11-16 00:25:12,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:12,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:12,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:12,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 106 [2019-11-16 00:25:12,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:12,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:12,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:12,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:12,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:12,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:12,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:12,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:12,881 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:12,902 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:12,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 59 [2019-11-16 00:25:12,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:12,969 INFO L567 ElimStorePlain]: treesize reduction 80, result has 49.0 percent of original size [2019-11-16 00:25:12,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:25:12,970 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:110, output treesize:78 [2019-11-16 00:25:13,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:13,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:13,085 INFO L341 Elim1Store]: treesize reduction 24, result has 61.3 percent of original size [2019-11-16 00:25:13,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 83 [2019-11-16 00:25:13,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:13,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:13,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2019-11-16 00:25:13,092 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:13,148 INFO L567 ElimStorePlain]: treesize reduction 46, result has 62.9 percent of original size [2019-11-16 00:25:13,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:25:13,149 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:116, output treesize:78 [2019-11-16 00:25:13,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:13,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:13,243 INFO L341 Elim1Store]: treesize reduction 12, result has 89.5 percent of original size [2019-11-16 00:25:13,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 144 [2019-11-16 00:25:13,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:13,274 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:13,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 90 [2019-11-16 00:25:13,274 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:13,375 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-11-16 00:25:13,375 INFO L567 ElimStorePlain]: treesize reduction 82, result has 57.7 percent of original size [2019-11-16 00:25:13,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:25:13,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:100, output treesize:112 [2019-11-16 00:25:13,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:13,496 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:13,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 114 [2019-11-16 00:25:13,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:13,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2019-11-16 00:25:13,512 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:13,668 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-11-16 00:25:13,669 INFO L567 ElimStorePlain]: treesize reduction 68, result has 62.2 percent of original size [2019-11-16 00:25:13,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:25:13,669 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:134, output treesize:126 [2019-11-16 00:25:13,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,101 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:14,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 181 [2019-11-16 00:25:14,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,187 INFO L496 ElimStorePlain]: Start of recursive call 2: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:14,253 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:14,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 118 [2019-11-16 00:25:14,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,260 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:14,805 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 141 [2019-11-16 00:25:14,805 INFO L567 ElimStorePlain]: treesize reduction 484, result has 42.9 percent of original size [2019-11-16 00:25:14,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-16 00:25:14,807 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:236, output treesize:476 [2019-11-16 00:25:14,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,972 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:14,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 175 treesize of output 219 [2019-11-16 00:25:14,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:14,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:14,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:15,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:15,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:15,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 146 [2019-11-16 00:25:15,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:15,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:15,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:15,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:15,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:15,043 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:15,339 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 49 [2019-11-16 00:25:15,339 INFO L567 ElimStorePlain]: treesize reduction 5846, result has 3.1 percent of original size [2019-11-16 00:25:15,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-16 00:25:15,340 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:286, output treesize:188 [2019-11-16 00:25:15,555 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:15,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 41 [2019-11-16 00:25:15,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:15,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:15,556 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:15,583 INFO L567 ElimStorePlain]: treesize reduction 12, result has 70.0 percent of original size [2019-11-16 00:25:15,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:15,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:28 [2019-11-16 00:25:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:15,742 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:15,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2019-11-16 00:25:15,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419067038] [2019-11-16 00:25:15,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-16 00:25:15,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:15,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-16 00:25:15,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1578, Unknown=9, NotChecked=0, Total=1806 [2019-11-16 00:25:15,744 INFO L87 Difference]: Start difference. First operand 254 states and 284 transitions. Second operand 43 states. [2019-11-16 00:25:17,387 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2019-11-16 00:25:19,075 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-11-16 00:25:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:20,935 INFO L93 Difference]: Finished difference Result 382 states and 420 transitions. [2019-11-16 00:25:20,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-16 00:25:20,935 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 51 [2019-11-16 00:25:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:20,936 INFO L225 Difference]: With dead ends: 382 [2019-11-16 00:25:20,937 INFO L226 Difference]: Without dead ends: 382 [2019-11-16 00:25:20,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1194, Invalid=5936, Unknown=10, NotChecked=0, Total=7140 [2019-11-16 00:25:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-16 00:25:20,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 253. [2019-11-16 00:25:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-16 00:25:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 282 transitions. [2019-11-16 00:25:20,942 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 282 transitions. Word has length 51 [2019-11-16 00:25:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:20,942 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 282 transitions. [2019-11-16 00:25:20,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-16 00:25:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 282 transitions. [2019-11-16 00:25:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:25:20,943 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:20,944 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:21,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:21,144 INFO L410 AbstractCegarLoop]: === Iteration 42 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:25:21,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1092973910, now seen corresponding path program 2 times [2019-11-16 00:25:21,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:21,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211318198] [2019-11-16 00:25:21,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:21,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:21,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:21,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211318198] [2019-11-16 00:25:21,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704768005] [2019-11-16 00:25:21,700 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:21,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:25:21,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:25:21,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 82 conjunts are in the unsatisfiable core [2019-11-16 00:25:21,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:21,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:25:21,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:21,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-16 00:25:22,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:25:22,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,045 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-11-16 00:25:22,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2019-11-16 00:25:22,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:22,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,126 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.6 percent of original size [2019-11-16 00:25:22,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:22,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,145 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:45 [2019-11-16 00:25:22,289 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-16 00:25:22,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,332 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.1 percent of original size [2019-11-16 00:25:22,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:25:22,335 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,353 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2019-11-16 00:25:22,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:22,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:25:22,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:22,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:25:22,440 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,461 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:62 [2019-11-16 00:25:22,518 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_66|], 6=[|v_#valid_121|]} [2019-11-16 00:25:22,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:22,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-16 00:25:22,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,578 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-16 00:25:22,579 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,646 INFO L567 ElimStorePlain]: treesize reduction 28, result has 74.1 percent of original size [2019-11-16 00:25:22,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:80 [2019-11-16 00:25:22,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:22,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:22,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,805 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:82 [2019-11-16 00:25:22,994 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_118|], 6=[|v_#memory_$Pointer$.base_151|]} [2019-11-16 00:25:22,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:22,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:25:22,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:23,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:23,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:23,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 122 [2019-11-16 00:25:23,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:23,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:23,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,073 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:23,150 INFO L567 ElimStorePlain]: treesize reduction 60, result has 59.2 percent of original size [2019-11-16 00:25:23,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:23,151 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:140, output treesize:100 [2019-11-16 00:25:23,230 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_119|], 12=[|v_#memory_$Pointer$.base_152|]} [2019-11-16 00:25:23,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:23,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:25:23,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:23,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:23,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:23,317 INFO L341 Elim1Store]: treesize reduction 24, result has 63.6 percent of original size [2019-11-16 00:25:23,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 85 [2019-11-16 00:25:23,318 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:23,383 INFO L567 ElimStorePlain]: treesize reduction 54, result has 64.9 percent of original size [2019-11-16 00:25:23,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:23,384 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:138, output treesize:100 [2019-11-16 00:25:23,386 INFO L392 ElimStorePlain]: Different costs {3=[|v_#length_67|], 6=[|v_#valid_122|]} [2019-11-16 00:25:23,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:23,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:23,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-11-16 00:25:23,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:23,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:23,445 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:23,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 41 [2019-11-16 00:25:23,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:23,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:23,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:23,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:102 [2019-11-16 00:25:23,548 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_120|], 12=[|v_#memory_$Pointer$.base_153|]} [2019-11-16 00:25:23,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:23,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:23,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:23,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:23,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 98 [2019-11-16 00:25:23,617 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:23,691 INFO L567 ElimStorePlain]: treesize reduction 72, result has 58.6 percent of original size [2019-11-16 00:25:23,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:23,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:124, output treesize:104 [2019-11-16 00:25:23,879 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_121|], 12=[|v_#memory_$Pointer$.base_154|]} [2019-11-16 00:25:23,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:23,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:25:23,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:23,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:23,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:23,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 187 [2019-11-16 00:25:23,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:23,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:23,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:23,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:23,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:23,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:23,990 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:24,110 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-11-16 00:25:24,111 INFO L567 ElimStorePlain]: treesize reduction 108, result has 49.5 percent of original size [2019-11-16 00:25:24,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:24,111 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:191, output treesize:128 [2019-11-16 00:25:24,178 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_122|], 12=[|v_#memory_$Pointer$.base_155|]} [2019-11-16 00:25:24,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:24,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 33 [2019-11-16 00:25:24,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:24,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:24,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:24,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 212 treesize of output 232 [2019-11-16 00:25:24,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:24,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-16 00:25:24,453 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-11-16 00:25:24,453 INFO L567 ElimStorePlain]: treesize reduction 910, result has 16.1 percent of original size [2019-11-16 00:25:24,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:24,454 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:283, output treesize:173 [2019-11-16 00:25:24,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-16 00:25:24,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:24,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:24,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:24,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:191, output treesize:176 [2019-11-16 00:25:24,944 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-16 00:25:24,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2019-11-16 00:25:24,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:24,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:24,992 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:24,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 87 [2019-11-16 00:25:24,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,995 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:25,082 INFO L567 ElimStorePlain]: treesize reduction 36, result has 60.0 percent of original size [2019-11-16 00:25:25,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:25,083 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:187, output treesize:31 [2019-11-16 00:25:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:25,274 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:25,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28] total 47 [2019-11-16 00:25:25,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785197899] [2019-11-16 00:25:25,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-16 00:25:25,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:25,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-16 00:25:25,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2025, Unknown=0, NotChecked=0, Total=2256 [2019-11-16 00:25:25,276 INFO L87 Difference]: Start difference. First operand 253 states and 282 transitions. Second operand 48 states. [2019-11-16 00:25:29,936 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-16 00:25:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:30,942 INFO L93 Difference]: Finished difference Result 389 states and 431 transitions. [2019-11-16 00:25:30,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-11-16 00:25:30,942 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 51 [2019-11-16 00:25:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:30,944 INFO L225 Difference]: With dead ends: 389 [2019-11-16 00:25:30,944 INFO L226 Difference]: Without dead ends: 389 [2019-11-16 00:25:30,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2561 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1085, Invalid=7471, Unknown=0, NotChecked=0, Total=8556 [2019-11-16 00:25:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-11-16 00:25:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 275. [2019-11-16 00:25:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-16 00:25:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 308 transitions. [2019-11-16 00:25:30,950 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 308 transitions. Word has length 51 [2019-11-16 00:25:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:30,950 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 308 transitions. [2019-11-16 00:25:30,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-11-16 00:25:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 308 transitions. [2019-11-16 00:25:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:25:30,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:30,951 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:31,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:31,155 INFO L410 AbstractCegarLoop]: === Iteration 43 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:25:31,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:31,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1092973911, now seen corresponding path program 2 times [2019-11-16 00:25:31,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:31,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350889514] [2019-11-16 00:25:31,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:31,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350889514] [2019-11-16 00:25:31,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227943268] [2019-11-16 00:25:31,564 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:31,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:25:31,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:25:31,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-16 00:25:31,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:31,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:25:31,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:31,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:31,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:31,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:25:31,848 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:31,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:25:31,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:31,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:31,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:31,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-16 00:25:31,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:31,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:31,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:31,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:31,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2019-11-16 00:25:31,999 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:31,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-16 00:25:32,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,021 INFO L567 ElimStorePlain]: treesize reduction 24, result has 55.6 percent of original size [2019-11-16 00:25:32,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:30 [2019-11-16 00:25:32,066 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-16 00:25:32,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:25:32,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:32,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:30 [2019-11-16 00:25:32,090 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:32,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:25:32,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,117 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.6 percent of original size [2019-11-16 00:25:32,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:39 [2019-11-16 00:25:32,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:32,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:32,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:45 [2019-11-16 00:25:32,337 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:32,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 106 [2019-11-16 00:25:32,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:32,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:32,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,346 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:32,442 INFO L567 ElimStorePlain]: treesize reduction 52, result has 53.2 percent of original size [2019-11-16 00:25:32,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:32,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:64 [2019-11-16 00:25:32,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:32,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:32,618 INFO L341 Elim1Store]: treesize reduction 24, result has 63.6 percent of original size [2019-11-16 00:25:32,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 94 [2019-11-16 00:25:32,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:32,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 50 [2019-11-16 00:25:32,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,764 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2019-11-16 00:25:32,764 INFO L567 ElimStorePlain]: treesize reduction 63, result has 60.4 percent of original size [2019-11-16 00:25:32,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-16 00:25:32,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:147, output treesize:96 [2019-11-16 00:25:32,968 INFO L341 Elim1Store]: treesize reduction 12, result has 89.5 percent of original size [2019-11-16 00:25:32,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 155 [2019-11-16 00:25:32,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:33,000 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:33,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 121 [2019-11-16 00:25:33,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:33,121 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-11-16 00:25:33,121 INFO L567 ElimStorePlain]: treesize reduction 82, result has 65.3 percent of original size [2019-11-16 00:25:33,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-16 00:25:33,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:154 [2019-11-16 00:25:33,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,251 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:33,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 90 [2019-11-16 00:25:33,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:33,280 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:33,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 125 [2019-11-16 00:25:33,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:33,399 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2019-11-16 00:25:33,399 INFO L567 ElimStorePlain]: treesize reduction 108, result has 53.8 percent of original size [2019-11-16 00:25:33,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-16 00:25:33,400 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:160, output treesize:140 [2019-11-16 00:25:33,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:33,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 157 treesize of output 192 [2019-11-16 00:25:33,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,844 INFO L496 ElimStorePlain]: Start of recursive call 2: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:33,887 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:33,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 121 [2019-11-16 00:25:33,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:33,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:33,890 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:34,304 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 148 [2019-11-16 00:25:34,304 INFO L567 ElimStorePlain]: treesize reduction 484, result has 44.3 percent of original size [2019-11-16 00:25:34,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 2 xjuncts. [2019-11-16 00:25:34,306 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:250, output treesize:512 [2019-11-16 00:25:34,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,483 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:34,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 186 treesize of output 230 [2019-11-16 00:25:34,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:34,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:34,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:34,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:34,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:34,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:34,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:34,537 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:34,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 149 [2019-11-16 00:25:34,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:34,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:34,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:34,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,541 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:34,802 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 47 [2019-11-16 00:25:34,802 INFO L567 ElimStorePlain]: treesize reduction 4965, result has 3.9 percent of original size [2019-11-16 00:25:34,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-16 00:25:34,803 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:300, output treesize:202 [2019-11-16 00:25:34,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:34,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 41 [2019-11-16 00:25:34,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:34,968 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:34,993 INFO L567 ElimStorePlain]: treesize reduction 12, result has 73.9 percent of original size [2019-11-16 00:25:34,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:34,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:77, output treesize:28 [2019-11-16 00:25:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:35,098 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:35,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2019-11-16 00:25:35,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90522707] [2019-11-16 00:25:35,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-16 00:25:35,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:35,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-16 00:25:35,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1568, Unknown=7, NotChecked=0, Total=1806 [2019-11-16 00:25:35,099 INFO L87 Difference]: Start difference. First operand 275 states and 308 transitions. Second operand 43 states. [2019-11-16 00:25:36,091 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-11-16 00:25:36,656 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-11-16 00:25:36,879 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-11-16 00:25:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:39,791 INFO L93 Difference]: Finished difference Result 480 states and 529 transitions. [2019-11-16 00:25:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-11-16 00:25:39,792 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 51 [2019-11-16 00:25:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:39,793 INFO L225 Difference]: With dead ends: 480 [2019-11-16 00:25:39,793 INFO L226 Difference]: Without dead ends: 480 [2019-11-16 00:25:39,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1286, Invalid=6712, Unknown=12, NotChecked=0, Total=8010 [2019-11-16 00:25:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-16 00:25:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 262. [2019-11-16 00:25:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-16 00:25:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 293 transitions. [2019-11-16 00:25:39,799 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 293 transitions. Word has length 51 [2019-11-16 00:25:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:39,799 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 293 transitions. [2019-11-16 00:25:39,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-16 00:25:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 293 transitions. [2019-11-16 00:25:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:25:39,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:39,800 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:40,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:40,001 INFO L410 AbstractCegarLoop]: === Iteration 44 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:25:40,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:40,001 INFO L82 PathProgramCache]: Analyzing trace with hash -678643987, now seen corresponding path program 3 times [2019-11-16 00:25:40,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:40,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632976825] [2019-11-16 00:25:40,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:40,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:40,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:40,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632976825] [2019-11-16 00:25:40,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565349632] [2019-11-16 00:25:40,471 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:40,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-16 00:25:40,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:25:40,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-16 00:25:40,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:40,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:25:40,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:40,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:40,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:40,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-16 00:25:40,972 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:40,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:25:40,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:40,999 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-11-16 00:25:40,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:40,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2019-11-16 00:25:41,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:41,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,072 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.0 percent of original size [2019-11-16 00:25:41,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:41,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,107 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:42 [2019-11-16 00:25:41,249 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:25:41,258 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2019-11-16 00:25:41,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,295 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.9 percent of original size [2019-11-16 00:25:41,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:41,299 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,315 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:52 [2019-11-16 00:25:41,368 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 6=[|v_#memory_$Pointer$.base_167|, |v_#memory_$Pointer$.offset_125|]} [2019-11-16 00:25:41,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:41,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:41,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:25:41,411 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:41,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:25:41,438 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,456 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:103, output treesize:61 [2019-11-16 00:25:41,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-16 00:25:41,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:59 [2019-11-16 00:25:41,603 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_31|], 6=[|v_#memory_$Pointer$.base_168|, |v_#memory_$Pointer$.offset_126|]} [2019-11-16 00:25:41,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:41,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:25:41,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:41,642 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,683 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.3 percent of original size [2019-11-16 00:25:41,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:41,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:41,687 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,704 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:96, output treesize:49 [2019-11-16 00:25:41,847 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_127|, |v_#memory_int_32|], 6=[|v_#memory_$Pointer$.base_169|]} [2019-11-16 00:25:41,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:41,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:25:41,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:41,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-16 00:25:41,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,921 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 99 [2019-11-16 00:25:41,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:41,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:41,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:41,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:41,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:41,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:41,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:41,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:41,924 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:41,964 INFO L567 ElimStorePlain]: treesize reduction 56, result has 49.1 percent of original size [2019-11-16 00:25:41,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,964 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:98, output treesize:52 [2019-11-16 00:25:42,014 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_33|], 6=[|v_#memory_$Pointer$.base_170|, |v_#memory_$Pointer$.offset_128|]} [2019-11-16 00:25:42,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-11-16 00:25:42,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:42,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:42,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:42,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 162 [2019-11-16 00:25:42,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:42,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:42,071 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:42,110 INFO L567 ElimStorePlain]: treesize reduction 112, result has 52.7 percent of original size [2019-11-16 00:25:42,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:42,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-11-16 00:25:42,114 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:42,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:42,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:42,126 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:180, output treesize:82 [2019-11-16 00:25:42,262 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-16 00:25:42,281 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:42,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 46 [2019-11-16 00:25:42,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:42,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:42,282 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:42,308 INFO L567 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size [2019-11-16 00:25:42,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-16 00:25:42,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:42,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:42,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:42,320 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:24 [2019-11-16 00:25:42,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:25:42,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-11-16 00:25:42,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:42,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:42,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:42,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2019-11-16 00:25:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:25:42,482 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:42,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2019-11-16 00:25:42,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115082491] [2019-11-16 00:25:42,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-16 00:25:42,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:42,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-16 00:25:42,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1581, Unknown=1, NotChecked=0, Total=1722 [2019-11-16 00:25:42,484 INFO L87 Difference]: Start difference. First operand 262 states and 293 transitions. Second operand 42 states. [2019-11-16 00:25:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:45,500 INFO L93 Difference]: Finished difference Result 304 states and 335 transitions. [2019-11-16 00:25:45,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-16 00:25:45,500 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 52 [2019-11-16 00:25:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:45,501 INFO L225 Difference]: With dead ends: 304 [2019-11-16 00:25:45,501 INFO L226 Difference]: Without dead ends: 304 [2019-11-16 00:25:45,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=398, Invalid=3507, Unknown=1, NotChecked=0, Total=3906 [2019-11-16 00:25:45,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-16 00:25:45,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 259. [2019-11-16 00:25:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-16 00:25:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 288 transitions. [2019-11-16 00:25:45,506 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 288 transitions. Word has length 52 [2019-11-16 00:25:45,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:45,506 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 288 transitions. [2019-11-16 00:25:45,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-16 00:25:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 288 transitions. [2019-11-16 00:25:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:25:45,507 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:45,508 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:45,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:45,712 INFO L410 AbstractCegarLoop]: === Iteration 45 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:25:45,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:45,713 INFO L82 PathProgramCache]: Analyzing trace with hash -151665752, now seen corresponding path program 1 times [2019-11-16 00:25:45,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:45,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689049583] [2019-11-16 00:25:45,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:45,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:45,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:25:45,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689049583] [2019-11-16 00:25:45,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49282232] [2019-11-16 00:25:45,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:46,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-16 00:25:46,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:46,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:46,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-11-16 00:25:46,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:46,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2019-11-16 00:25:46,312 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:46,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:46,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-11-16 00:25:46,347 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:46,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-11-16 00:25:46,350 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:46,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:46,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:25:46,376 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:23 [2019-11-16 00:25:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:25:46,540 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:46,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-11-16 00:25:46,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351125831] [2019-11-16 00:25:46,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:25:46,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:46,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:25:46,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:25:46,541 INFO L87 Difference]: Start difference. First operand 259 states and 288 transitions. Second operand 20 states. [2019-11-16 00:25:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:47,807 INFO L93 Difference]: Finished difference Result 296 states and 325 transitions. [2019-11-16 00:25:47,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:25:47,807 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2019-11-16 00:25:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:47,809 INFO L225 Difference]: With dead ends: 296 [2019-11-16 00:25:47,809 INFO L226 Difference]: Without dead ends: 296 [2019-11-16 00:25:47,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:25:47,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-16 00:25:47,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 259. [2019-11-16 00:25:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-16 00:25:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 286 transitions. [2019-11-16 00:25:47,812 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 286 transitions. Word has length 53 [2019-11-16 00:25:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:47,813 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 286 transitions. [2019-11-16 00:25:47,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:25:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 286 transitions. [2019-11-16 00:25:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:25:47,814 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:47,814 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:48,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:48,018 INFO L410 AbstractCegarLoop]: === Iteration 46 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:25:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:48,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1784922118, now seen corresponding path program 1 times [2019-11-16 00:25:48,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:48,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936315322] [2019-11-16 00:25:48,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:48,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:48,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:48,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936315322] [2019-11-16 00:25:48,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50949414] [2019-11-16 00:25:48,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:48,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-16 00:25:48,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:48,965 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:48,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:25:48,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:48,976 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:25:48,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:48,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-16 00:25:49,042 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-16 00:25:49,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2019-11-16 00:25:49,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:49,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2019-11-16 00:25:49,224 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 50 [2019-11-16 00:25:49,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,246 INFO L567 ElimStorePlain]: treesize reduction 24, result has 56.4 percent of original size [2019-11-16 00:25:49,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:31 [2019-11-16 00:25:49,289 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-16 00:25:49,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:25:49,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:31 [2019-11-16 00:25:49,305 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:25:49,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-11-16 00:25:49,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:49,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2019-11-16 00:25:49,501 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 100 [2019-11-16 00:25:49,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,510 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:49,590 INFO L567 ElimStorePlain]: treesize reduction 52, result has 46.4 percent of original size [2019-11-16 00:25:49,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:49,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2019-11-16 00:25:49,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:49,675 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 93 [2019-11-16 00:25:49,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:49,827 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-16 00:25:49,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 165 [2019-11-16 00:25:49,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:49,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:49,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:50,058 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 28 [2019-11-16 00:25:50,058 INFO L567 ElimStorePlain]: treesize reduction 5821, result has 1.4 percent of original size [2019-11-16 00:25:50,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-16 00:25:50,059 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:153, output treesize:79 [2019-11-16 00:25:50,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:50,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:50,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2019-11-16 00:25:50,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:50,154 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:50,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 64 [2019-11-16 00:25:50,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:50,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:50,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:50,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:50,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:50,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:50,157 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:50,173 INFO L567 ElimStorePlain]: treesize reduction 65, result has 15.6 percent of original size [2019-11-16 00:25:50,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:50,174 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:93, output treesize:8 [2019-11-16 00:25:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:25:50,244 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:50,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 39 [2019-11-16 00:25:50,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906057143] [2019-11-16 00:25:50,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-16 00:25:50,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:50,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-16 00:25:50,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1324, Unknown=1, NotChecked=0, Total=1482 [2019-11-16 00:25:50,245 INFO L87 Difference]: Start difference. First operand 259 states and 286 transitions. Second operand 39 states. [2019-11-16 00:25:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:53,082 INFO L93 Difference]: Finished difference Result 359 states and 390 transitions. [2019-11-16 00:25:53,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-16 00:25:53,082 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 54 [2019-11-16 00:25:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:53,083 INFO L225 Difference]: With dead ends: 359 [2019-11-16 00:25:53,083 INFO L226 Difference]: Without dead ends: 350 [2019-11-16 00:25:53,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=812, Invalid=3879, Unknown=1, NotChecked=0, Total=4692 [2019-11-16 00:25:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-16 00:25:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 296. [2019-11-16 00:25:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-16 00:25:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 336 transitions. [2019-11-16 00:25:53,088 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 336 transitions. Word has length 54 [2019-11-16 00:25:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:53,088 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 336 transitions. [2019-11-16 00:25:53,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-16 00:25:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 336 transitions. [2019-11-16 00:25:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:25:53,089 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:53,090 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:53,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:53,293 INFO L410 AbstractCegarLoop]: === Iteration 47 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:25:53,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:53,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1427443877, now seen corresponding path program 1 times [2019-11-16 00:25:53,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:53,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002242714] [2019-11-16 00:25:53,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:53,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:53,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:53,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002242714] [2019-11-16 00:25:53,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962752732] [2019-11-16 00:25:53,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:54,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-16 00:25:54,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:54,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-16 00:25:54,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,225 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-16 00:25:54,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-16 00:25:54,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:54,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:54,285 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-16 00:25:54,441 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-16 00:25:54,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,476 INFO L567 ElimStorePlain]: treesize reduction 24, result has 70.4 percent of original size [2019-11-16 00:25:54,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:54,479 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,493 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:49 [2019-11-16 00:25:54,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:54,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:25:54,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:54,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-16 00:25:54,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,594 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-16 00:25:54,605 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-16 00:25:54,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:50 [2019-11-16 00:25:54,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:54,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:25:54,747 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:48 [2019-11-16 00:25:54,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:54,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:54,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2019-11-16 00:25:54,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:55,028 INFO L567 ElimStorePlain]: treesize reduction 3, result has 97.0 percent of original size [2019-11-16 00:25:55,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:55,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 114 [2019-11-16 00:25:55,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:55,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:55,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,082 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:55,150 INFO L567 ElimStorePlain]: treesize reduction 60, result has 52.0 percent of original size [2019-11-16 00:25:55,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:55,151 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:78 [2019-11-16 00:25:55,236 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:55,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 176 [2019-11-16 00:25:55,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:55,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:55,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:55,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 117 treesize of output 128 [2019-11-16 00:25:55,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,289 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-16 00:25:55,342 INFO L567 ElimStorePlain]: treesize reduction 607, result has 12.8 percent of original size [2019-11-16 00:25:55,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:55,342 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:222, output treesize:88 [2019-11-16 00:25:55,882 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-16 00:25:55,883 INFO L341 Elim1Store]: treesize reduction 8, result has 92.9 percent of original size [2019-11-16 00:25:55,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 140 treesize of output 171 [2019-11-16 00:25:55,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:55,918 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:55,963 INFO L567 ElimStorePlain]: treesize reduction 125, result has 30.6 percent of original size [2019-11-16 00:25:55,972 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:55,972 INFO L375 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 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2019-11-16 00:25:55,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:55,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:55,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:55,981 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:150, output treesize:10 [2019-11-16 00:25:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:56,075 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:56,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2019-11-16 00:25:56,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49707773] [2019-11-16 00:25:56,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-16 00:25:56,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:56,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-16 00:25:56,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1730, Unknown=0, NotChecked=0, Total=1892 [2019-11-16 00:25:56,076 INFO L87 Difference]: Start difference. First operand 296 states and 336 transitions. Second operand 44 states. [2019-11-16 00:25:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:58,336 INFO L93 Difference]: Finished difference Result 289 states and 321 transitions. [2019-11-16 00:25:58,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-16 00:25:58,336 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2019-11-16 00:25:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:58,337 INFO L225 Difference]: With dead ends: 289 [2019-11-16 00:25:58,338 INFO L226 Difference]: Without dead ends: 289 [2019-11-16 00:25:58,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=368, Invalid=3414, Unknown=0, NotChecked=0, Total=3782 [2019-11-16 00:25:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-16 00:25:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-11-16 00:25:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-16 00:25:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 318 transitions. [2019-11-16 00:25:58,341 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 318 transitions. Word has length 54 [2019-11-16 00:25:58,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:58,341 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 318 transitions. [2019-11-16 00:25:58,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-16 00:25:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 318 transitions. [2019-11-16 00:25:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:25:58,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:58,342 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:58,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:58,542 INFO L410 AbstractCegarLoop]: === Iteration 48 === [mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION]=== [2019-11-16 00:25:58,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:58,543 INFO L82 PathProgramCache]: Analyzing trace with hash 783859407, now seen corresponding path program 1 times [2019-11-16 00:25:58,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:58,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131405117] [2019-11-16 00:25:58,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:58,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:58,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:58,561 ERROR L253 erpolLogProxyWrapper]: Interpolant 12 not inductive [2019-11-16 00:25:58,570 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:863) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:385) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:332) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:25:58,574 INFO L168 Benchmark]: Toolchain (without parser) took 163816.11 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 508.6 MB). Free memory was 939.3 MB in the beginning and 963.2 MB in the end (delta: -23.8 MB). Peak memory consumption was 484.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:58,575 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:25:58,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:58,575 INFO L168 Benchmark]: Boogie Preprocessor took 125.43 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:58,575 INFO L168 Benchmark]: RCFGBuilder took 817.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.0 MB). Peak memory consumption was 66.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:58,575 INFO L168 Benchmark]: TraceAbstraction took 162246.58 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 374.9 MB). Free memory was 1.0 GB in the beginning and 963.2 MB in the end (delta: 78.4 MB). Peak memory consumption was 453.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:25:58,576 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 621.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 125.43 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 817.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.0 MB). Peak memory consumption was 66.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 162246.58 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 374.9 MB). Free memory was 1.0 GB in the beginning and 963.2 MB in the end (delta: 78.4 MB). Peak memory consumption was 453.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:221) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:26:00,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:26:00,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:26:00,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:26:00,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:26:00,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:26:00,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:26:00,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:26:00,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:26:00,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:26:00,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:26:00,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:26:00,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:26:00,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:26:00,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:26:00,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:26:00,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:26:00,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:26:00,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:26:00,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:26:00,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:26:00,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:26:00,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:26:00,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:26:00,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:26:00,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:26:00,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:26:00,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:26:00,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:26:00,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:26:00,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:26:00,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:26:00,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:26:00,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:26:00,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:26:00,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:26:00,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:26:00,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:26:00,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:26:00,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:26:00,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:26:00,817 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-16 00:26:00,836 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:26:00,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:26:00,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:26:00,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:26:00,840 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:26:00,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:26:00,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:26:00,841 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:26:00,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:26:00,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:26:00,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:26:00,843 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:26:00,843 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:26:00,843 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:26:00,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:26:00,844 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:26:00,844 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:26:00,844 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:26:00,845 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:26:00,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:26:00,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:26:00,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:26:00,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:26:00,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:26:00,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:26:00,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:26:00,847 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:26:00,847 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:26:00,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:26:00,847 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_7f3b2192-8d52-4d66-93fe-9f2b4989a299/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 -> 436b5c72ff67e2244c8257fbd882ddaf383eff22 [2019-11-16 00:26:00,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:26:00,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:26:00,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:26:00,923 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:26:00,924 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:26:00,924 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2019-11-16 00:26:00,995 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/data/077f9c0a5/68afc74f9526488d8a455f6adf285a7a/FLAG1138c9271 [2019-11-16 00:26:01,461 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:26:01,462 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2019-11-16 00:26:01,475 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/data/077f9c0a5/68afc74f9526488d8a455f6adf285a7a/FLAG1138c9271 [2019-11-16 00:26:01,835 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/data/077f9c0a5/68afc74f9526488d8a455f6adf285a7a [2019-11-16 00:26:01,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:26:01,838 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:26:01,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:01,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:26:01,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:26:01,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:01" (1/1) ... [2019-11-16 00:26:01,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c857c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:01, skipping insertion in model container [2019-11-16 00:26:01,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:01" (1/1) ... [2019-11-16 00:26:01,854 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:26:01,911 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:26:02,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:02,304 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:26:02,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:02,393 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:26:02,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:02 WrapperNode [2019-11-16 00:26:02,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:02,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:26:02,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:26:02,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:26:02,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:02" (1/1) ... [2019-11-16 00:26:02,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:02" (1/1) ... [2019-11-16 00:26:02,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:02" (1/1) ... [2019-11-16 00:26:02,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:02" (1/1) ... [2019-11-16 00:26:02,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:02" (1/1) ... [2019-11-16 00:26:02,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:02" (1/1) ... [2019-11-16 00:26:02,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:02" (1/1) ... [2019-11-16 00:26:02,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:26:02,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:26:02,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:26:02,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:26:02,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:26:02,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:26:02,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:26:02,571 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:26:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:26:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:26:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:26:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:26:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:26:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:26:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:26:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:26:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:26:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:26:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:26:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:26:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:26:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:26:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:26:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:26:02,574 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:26:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:26:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:26:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:26:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:26:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:26:02,575 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:26:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:26:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:26:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:26:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:26:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:26:02,576 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:26:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:26:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:26:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:26:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:26:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:26:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:26:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:26:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:26:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:26:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:26:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:26:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:26:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:26:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:26:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:26:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:26:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:26:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:26:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:26:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:26:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:26:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:26:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:26:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:26:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:26:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:26:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:26:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:26:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:26:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:26:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:26:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:26:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:26:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:26:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:26:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:26:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:26:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:26:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:26:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:26:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:26:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:26:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:26:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:26:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:26:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:26:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:26:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:26:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:26:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:26:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:26:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:26:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:26:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:26:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:26:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:26:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:26:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:26:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:26:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:26:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:26:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:26:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:26:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:26:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:26:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:26:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:26:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:26:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:26:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:26:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:26:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:26:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:26:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:26:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-16 00:26:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:26:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:26:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:26:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:26:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:26:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:26:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:26:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:26:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:26:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:26:03,524 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:26:03,524 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-16 00:26:03,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:03 BoogieIcfgContainer [2019-11-16 00:26:03,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:26:03,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:26:03,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:26:03,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:26:03,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:26:01" (1/3) ... [2019-11-16 00:26:03,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ebe80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:03, skipping insertion in model container [2019-11-16 00:26:03,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:02" (2/3) ... [2019-11-16 00:26:03,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ebe80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:03, skipping insertion in model container [2019-11-16 00:26:03,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:03" (3/3) ... [2019-11-16 00:26:03,537 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-1.i [2019-11-16 00:26:03,546 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:26:03,556 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2019-11-16 00:26:03,567 INFO L249 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2019-11-16 00:26:03,582 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:26:03,583 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:26:03,583 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:26:03,583 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:26:03,583 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:26:03,583 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:26:03,583 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:26:03,584 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:26:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-16 00:26:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:26:03,627 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:03,629 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:03,634 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr37REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr56ENSURES_VIOLATIONMEMORY_LEAK, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION]=== [2019-11-16 00:26:03,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:03,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2095448578, now seen corresponding path program 1 times [2019-11-16 00:26:03,646 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:26:03,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1064801702] [2019-11-16 00:26:03,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f3b2192-8d52-4d66-93fe-9f2b4989a299/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:26:03,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:26:03,865 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:26:03,872 INFO L168 Benchmark]: Toolchain (without parser) took 2031.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 942.9 MB in the beginning and 983.9 MB in the end (delta: -40.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:03,873 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:26:03,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -119.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:03,875 INFO L168 Benchmark]: Boogie Preprocessor took 116.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:26:03,877 INFO L168 Benchmark]: RCFGBuilder took 1014.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.3 MB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:03,878 INFO L168 Benchmark]: TraceAbstraction took 342.06 ms. Allocated memory is still 1.1 GB. Free memory was 996.3 MB in the beginning and 983.9 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:03,888 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.79 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 555.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -119.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 116.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1014.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.3 MB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 342.06 ms. Allocated memory is still 1.1 GB. Free memory was 996.3 MB in the beginning and 983.9 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...