./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-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_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/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 c7acae308721d0f16fed709193be74827b826330 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/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 c7acae308721d0f16fed709193be74827b826330 ..................................................................................................................................................................................................................................................................................................................................................... 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-15 22:23:32,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:23:32,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:23:32,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:23:32,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:23:32,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:23:32,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:23:32,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:23:32,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:23:32,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:23:32,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:23:32,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:23:32,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:23:32,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:23:32,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:23:32,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:23:32,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:23:32,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:23:32,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:23:32,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:23:32,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:23:32,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:23:32,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:23:32,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:23:32,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:23:32,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:23:32,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:23:32,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:23:32,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:23:32,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:23:32,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:23:32,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:23:32,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:23:32,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:23:32,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:23:32,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:23:32,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:23:32,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:23:32,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:23:32,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:23:32,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:23:32,817 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 22:23:32,841 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:23:32,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:23:32,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:23:32,852 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:23:32,852 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:23:32,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:23:32,852 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:23:32,853 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:23:32,853 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:23:32,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:23:32,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:23:32,854 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:23:32,854 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:23:32,854 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:23:32,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:23:32,855 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:23:32,856 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:23:32,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:23:32,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:23:32,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:23:32,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:23:32,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:23:32,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:23:32,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:23:32,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:23:32,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:23:32,859 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_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/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 -> c7acae308721d0f16fed709193be74827b826330 [2019-11-15 22:23:32,896 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:23:32,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:23:32,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:23:32,915 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:23:32,916 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:23:32,916 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2019-11-15 22:23:32,977 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/data/6d648e127/fe62c647e8b04ecda61dc6f6daa28ee4/FLAG1e85c2788 [2019-11-15 22:23:33,498 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:23:33,499 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2019-11-15 22:23:33,517 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/data/6d648e127/fe62c647e8b04ecda61dc6f6daa28ee4/FLAG1e85c2788 [2019-11-15 22:23:33,794 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/data/6d648e127/fe62c647e8b04ecda61dc6f6daa28ee4 [2019-11-15 22:23:33,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:23:33,798 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:23:33,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:23:33,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:23:33,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:23:33,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:23:33" (1/1) ... [2019-11-15 22:23:33,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30031fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:23:33, skipping insertion in model container [2019-11-15 22:23:33,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:23:33" (1/1) ... [2019-11-15 22:23:33,821 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:23:33,873 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:23:34,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:23:34,220 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:23:34,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:23:34,357 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:23:34,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:23:34 WrapperNode [2019-11-15 22:23:34,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:23:34,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:23:34,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:23:34,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:23:34,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:23:34" (1/1) ... [2019-11-15 22:23:34,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:23:34" (1/1) ... [2019-11-15 22:23:34,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:23:34" (1/1) ... [2019-11-15 22:23:34,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:23:34" (1/1) ... [2019-11-15 22:23:34,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:23:34" (1/1) ... [2019-11-15 22:23:34,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:23:34" (1/1) ... [2019-11-15 22:23:34,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:23:34" (1/1) ... [2019-11-15 22:23:34,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:23:34,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:23:34,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:23:34,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:23:34,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:23:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:23:34,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:23:34,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:23:34,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:23:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:23:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:23:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:23:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:23:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:23:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:23:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:23:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:23:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:23:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:23:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:23:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:23:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:23:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:23:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:23:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:23:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:23:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:23:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:23:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:23:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:23:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:23:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:23:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:23:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:23:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:23:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:23:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:23:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:23:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:23:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:23:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:23:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:23:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:23:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:23:34,502 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:23:34,502 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:23:34,502 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:23:34,502 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:23:34,502 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:23:34,502 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:23:34,503 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:23:34,503 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:23:34,503 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:23:34,503 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:23:34,503 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:23:34,503 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:23:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:23:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:23:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:23:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:23:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:23:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:23:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:23:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:23:34,505 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:23:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:23:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:23:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:23:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:23:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:23:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:23:34,506 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:23:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:23:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:23:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:23:34,507 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:23:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:23:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:23:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:23:34,508 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:23:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:23:34,509 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:23:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:23:34,510 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:23:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:23:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:23:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:23:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:23:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:23:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:23:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:23:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:23:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:23:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:23:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:23:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:23:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:23:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:23:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:23:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:23:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:23:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:23:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:23:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:23:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:23:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:23:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:23:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:23:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:23:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:23:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:23:34,515 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:23:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:23:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:23:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:23:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:23:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:23:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:23:34,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:23:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:23:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:23:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:23:34,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:23:35,241 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:23:35,241 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 22:23:35,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:23:35 BoogieIcfgContainer [2019-11-15 22:23:35,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:23:35,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:23:35,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:23:35,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:23:35,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:23:33" (1/3) ... [2019-11-15 22:23:35,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e894432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:23:35, skipping insertion in model container [2019-11-15 22:23:35,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:23:34" (2/3) ... [2019-11-15 22:23:35,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e894432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:23:35, skipping insertion in model container [2019-11-15 22:23:35,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:23:35" (3/3) ... [2019-11-15 22:23:35,249 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2019-11-15 22:23:35,257 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:23:35,270 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 50 error locations. [2019-11-15 22:23:35,280 INFO L249 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2019-11-15 22:23:35,294 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:23:35,295 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:23:35,295 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:23:35,295 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:23:35,295 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:23:35,295 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:23:35,295 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:23:35,295 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:23:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states. [2019-11-15 22:23:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:23:35,320 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:35,320 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:35,322 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:35,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:35,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1810038840, now seen corresponding path program 1 times [2019-11-15 22:23:35,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:35,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032931661] [2019-11-15 22:23:35,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:35,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:35,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:35,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032931661] [2019-11-15 22:23:35,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:35,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:23:35,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205270601] [2019-11-15 22:23:35,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:23:35,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:35,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:23:35,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:35,553 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 4 states. [2019-11-15 22:23:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:36,014 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2019-11-15 22:23:36,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:23:36,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 22:23:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:36,028 INFO L225 Difference]: With dead ends: 117 [2019-11-15 22:23:36,029 INFO L226 Difference]: Without dead ends: 113 [2019-11-15 22:23:36,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:23:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-15 22:23:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2019-11-15 22:23:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 22:23:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-11-15 22:23:36,080 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 7 [2019-11-15 22:23:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:36,080 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-11-15 22:23:36,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:23:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-11-15 22:23:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:23:36,081 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:36,081 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:36,082 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:36,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1810038841, now seen corresponding path program 1 times [2019-11-15 22:23:36,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:36,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701407248] [2019-11-15 22:23:36,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:36,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:36,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:36,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701407248] [2019-11-15 22:23:36,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:36,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:23:36,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340207461] [2019-11-15 22:23:36,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:23:36,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:36,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:23:36,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:36,147 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 4 states. [2019-11-15 22:23:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:36,431 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2019-11-15 22:23:36,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:23:36,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 22:23:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:36,434 INFO L225 Difference]: With dead ends: 127 [2019-11-15 22:23:36,434 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 22:23:36,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 22:23:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2019-11-15 22:23:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 22:23:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2019-11-15 22:23:36,446 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 7 [2019-11-15 22:23:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:36,446 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2019-11-15 22:23:36,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:23:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2019-11-15 22:23:36,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 22:23:36,447 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:36,447 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:36,448 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash -399481482, now seen corresponding path program 1 times [2019-11-15 22:23:36,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:36,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777036163] [2019-11-15 22:23:36,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:36,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:36,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:36,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777036163] [2019-11-15 22:23:36,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:36,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:23:36,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820621041] [2019-11-15 22:23:36,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:23:36,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:36,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:23:36,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:23:36,553 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 5 states. [2019-11-15 22:23:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:36,991 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-11-15 22:23:36,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:23:36,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 22:23:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:36,993 INFO L225 Difference]: With dead ends: 119 [2019-11-15 22:23:36,993 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 22:23:36,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:23:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 22:23:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2019-11-15 22:23:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 22:23:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2019-11-15 22:23:37,014 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 12 [2019-11-15 22:23:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:37,015 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2019-11-15 22:23:37,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:23:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2019-11-15 22:23:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 22:23:37,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:37,016 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:37,017 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:37,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:37,022 INFO L82 PathProgramCache]: Analyzing trace with hash -399481481, now seen corresponding path program 1 times [2019-11-15 22:23:37,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:37,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695116854] [2019-11-15 22:23:37,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:37,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:37,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:37,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695116854] [2019-11-15 22:23:37,188 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:37,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:23:37,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979207024] [2019-11-15 22:23:37,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:23:37,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:37,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:23:37,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:23:37,190 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 8 states. [2019-11-15 22:23:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:37,707 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2019-11-15 22:23:37,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:23:37,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-11-15 22:23:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:37,710 INFO L225 Difference]: With dead ends: 134 [2019-11-15 22:23:37,710 INFO L226 Difference]: Without dead ends: 134 [2019-11-15 22:23:37,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:23:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-15 22:23:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2019-11-15 22:23:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 22:23:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2019-11-15 22:23:37,731 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 12 [2019-11-15 22:23:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:37,732 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2019-11-15 22:23:37,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:23:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2019-11-15 22:23:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:23:37,733 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:37,733 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:37,734 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:37,734 INFO L82 PathProgramCache]: Analyzing trace with hash 401540100, now seen corresponding path program 1 times [2019-11-15 22:23:37,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:37,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169236576] [2019-11-15 22:23:37,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:37,735 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:37,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:37,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169236576] [2019-11-15 22:23:37,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:37,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:37,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42286368] [2019-11-15 22:23:37,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:23:37,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:37,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:23:37,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:37,917 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 7 states. [2019-11-15 22:23:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:38,498 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2019-11-15 22:23:38,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:23:38,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 22:23:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:38,500 INFO L225 Difference]: With dead ends: 177 [2019-11-15 22:23:38,500 INFO L226 Difference]: Without dead ends: 177 [2019-11-15 22:23:38,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:23:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-15 22:23:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 110. [2019-11-15 22:23:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:23:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-15 22:23:38,522 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 15 [2019-11-15 22:23:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:38,527 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-15 22:23:38,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:23:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-15 22:23:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:23:38,528 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:38,529 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:38,529 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:38,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:38,530 INFO L82 PathProgramCache]: Analyzing trace with hash 401540101, now seen corresponding path program 1 times [2019-11-15 22:23:38,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:38,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104312095] [2019-11-15 22:23:38,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:38,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:38,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:38,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104312095] [2019-11-15 22:23:38,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:38,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:38,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551636572] [2019-11-15 22:23:38,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:23:38,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:38,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:23:38,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:38,676 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 7 states. [2019-11-15 22:23:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:39,180 INFO L93 Difference]: Finished difference Result 182 states and 200 transitions. [2019-11-15 22:23:39,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:23:39,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 22:23:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:39,182 INFO L225 Difference]: With dead ends: 182 [2019-11-15 22:23:39,182 INFO L226 Difference]: Without dead ends: 182 [2019-11-15 22:23:39,183 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-15 22:23:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-15 22:23:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 105. [2019-11-15 22:23:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 22:23:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2019-11-15 22:23:39,194 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 15 [2019-11-15 22:23:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:39,194 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2019-11-15 22:23:39,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:23:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2019-11-15 22:23:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:23:39,195 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:39,196 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:39,196 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:39,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1931841904, now seen corresponding path program 1 times [2019-11-15 22:23:39,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:39,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142508082] [2019-11-15 22:23:39,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:39,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:39,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:39,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142508082] [2019-11-15 22:23:39,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:39,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:39,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513183961] [2019-11-15 22:23:39,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:23:39,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:39,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:23:39,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:23:39,284 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 6 states. [2019-11-15 22:23:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:39,484 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-11-15 22:23:39,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:23:39,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-15 22:23:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:39,487 INFO L225 Difference]: With dead ends: 127 [2019-11-15 22:23:39,487 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 22:23:39,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:23:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 22:23:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2019-11-15 22:23:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 22:23:39,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2019-11-15 22:23:39,491 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 21 [2019-11-15 22:23:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:39,492 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2019-11-15 22:23:39,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:23:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2019-11-15 22:23:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:23:39,493 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:39,493 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:39,493 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:39,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:39,498 INFO L82 PathProgramCache]: Analyzing trace with hash -755402509, now seen corresponding path program 1 times [2019-11-15 22:23:39,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:39,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212515621] [2019-11-15 22:23:39,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:39,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:39,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:39,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212515621] [2019-11-15 22:23:39,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:39,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:39,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576815984] [2019-11-15 22:23:39,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:23:39,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:39,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:23:39,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:39,605 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 7 states. [2019-11-15 22:23:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:40,022 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2019-11-15 22:23:40,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:23:40,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-15 22:23:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:40,024 INFO L225 Difference]: With dead ends: 166 [2019-11-15 22:23:40,024 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 22:23:40,024 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-15 22:23:40,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 22:23:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2019-11-15 22:23:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 22:23:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2019-11-15 22:23:40,028 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 23 [2019-11-15 22:23:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:40,029 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2019-11-15 22:23:40,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:23:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2019-11-15 22:23:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:23:40,030 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:40,030 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:40,030 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:40,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:40,031 INFO L82 PathProgramCache]: Analyzing trace with hash -755402508, now seen corresponding path program 1 times [2019-11-15 22:23:40,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:40,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559842820] [2019-11-15 22:23:40,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:40,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:40,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:40,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559842820] [2019-11-15 22:23:40,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:40,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:40,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178304739] [2019-11-15 22:23:40,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:23:40,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:40,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:23:40,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:40,124 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 7 states. [2019-11-15 22:23:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:40,636 INFO L93 Difference]: Finished difference Result 184 states and 201 transitions. [2019-11-15 22:23:40,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:23:40,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-15 22:23:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:40,638 INFO L225 Difference]: With dead ends: 184 [2019-11-15 22:23:40,638 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 22:23:40,638 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-15 22:23:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 22:23:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 96. [2019-11-15 22:23:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 22:23:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-15 22:23:40,643 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 23 [2019-11-15 22:23:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:40,643 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-15 22:23:40,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:23:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-15 22:23:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:23:40,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:40,645 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] [2019-11-15 22:23:40,645 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:40,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1029811992, now seen corresponding path program 1 times [2019-11-15 22:23:40,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:40,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845201271] [2019-11-15 22:23:40,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:40,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:40,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:40,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845201271] [2019-11-15 22:23:40,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638102378] [2019-11-15 22:23:40,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:40,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 22:23:40,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:40,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:40,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:40,946 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-11-15 22:23:40,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-15 22:23:40,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:40,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:40,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:40,957 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2019-11-15 22:23:40,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:40,992 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-15 22:23:40,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:41,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:41,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:41,009 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-15 22:23:41,010 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:41,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:41,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:41,015 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:18 [2019-11-15 22:23:41,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:23:41,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:41,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:41,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:23:41,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:41,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:41,074 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-15 22:23:41,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-15 22:23:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:41,079 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:23:41,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-15 22:23:41,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360591418] [2019-11-15 22:23:41,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:23:41,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:41,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:23:41,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:23:41,081 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 10 states. [2019-11-15 22:23:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:41,613 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2019-11-15 22:23:41,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:23:41,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-15 22:23:41,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:41,615 INFO L225 Difference]: With dead ends: 156 [2019-11-15 22:23:41,615 INFO L226 Difference]: Without dead ends: 156 [2019-11-15 22:23:41,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:23:41,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-15 22:23:41,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 110. [2019-11-15 22:23:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:23:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-15 22:23:41,620 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 24 [2019-11-15 22:23:41,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:41,620 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-15 22:23:41,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:23:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-15 22:23:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 22:23:41,621 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:41,621 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:41,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:41,825 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:41,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:41,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1251332834, now seen corresponding path program 1 times [2019-11-15 22:23:41,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:41,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072880831] [2019-11-15 22:23:41,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:41,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:41,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:41,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072880831] [2019-11-15 22:23:41,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:41,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:23:41,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996375487] [2019-11-15 22:23:41,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:23:41,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:41,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:23:41,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:23:41,936 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 6 states. [2019-11-15 22:23:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:42,129 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-15 22:23:42,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:23:42,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-15 22:23:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:42,130 INFO L225 Difference]: With dead ends: 113 [2019-11-15 22:23:42,130 INFO L226 Difference]: Without dead ends: 113 [2019-11-15 22:23:42,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-15 22:23:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2019-11-15 22:23:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 22:23:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-15 22:23:42,133 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 25 [2019-11-15 22:23:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:42,133 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-15 22:23:42,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:23:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-15 22:23:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:23:42,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:42,134 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-15 22:23:42,134 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:42,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:42,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1806843450, now seen corresponding path program 1 times [2019-11-15 22:23:42,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:42,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027891873] [2019-11-15 22:23:42,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:42,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:42,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:42,182 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-15 22:23:42,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027891873] [2019-11-15 22:23:42,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:42,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:23:42,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987340775] [2019-11-15 22:23:42,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:23:42,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:42,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:23:42,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:42,184 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 4 states. [2019-11-15 22:23:42,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:42,320 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2019-11-15 22:23:42,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:23:42,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-15 22:23:42,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:42,321 INFO L225 Difference]: With dead ends: 119 [2019-11-15 22:23:42,322 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 22:23:42,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 22:23:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2019-11-15 22:23:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 22:23:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-11-15 22:23:42,325 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 26 [2019-11-15 22:23:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:42,325 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-11-15 22:23:42,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:23:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-11-15 22:23:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:23:42,326 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:42,327 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] [2019-11-15 22:23:42,327 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:42,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:42,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1912045509, now seen corresponding path program 1 times [2019-11-15 22:23:42,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:42,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687562122] [2019-11-15 22:23:42,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:42,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:42,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:42,365 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-15 22:23:42,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687562122] [2019-11-15 22:23:42,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:23:42,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:23:42,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934574321] [2019-11-15 22:23:42,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:23:42,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:42,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:23:42,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:42,366 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 4 states. [2019-11-15 22:23:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:42,500 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2019-11-15 22:23:42,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:23:42,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-15 22:23:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:42,501 INFO L225 Difference]: With dead ends: 111 [2019-11-15 22:23:42,501 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 22:23:42,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:23:42,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 22:23:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-15 22:23:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 22:23:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-11-15 22:23:42,506 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 30 [2019-11-15 22:23:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:42,507 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-11-15 22:23:42,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:23:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-11-15 22:23:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 22:23:42,508 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:42,508 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:23:42,509 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:42,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:42,509 INFO L82 PathProgramCache]: Analyzing trace with hash 528658354, now seen corresponding path program 1 times [2019-11-15 22:23:42,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:42,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404451808] [2019-11-15 22:23:42,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:42,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:42,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:42,586 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-15 22:23:42,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404451808] [2019-11-15 22:23:42,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977044143] [2019-11-15 22:23:42,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:42,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:23:42,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:42,710 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-15 22:23:42,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:42,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:42,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:42,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 22:23:42,721 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-15 22:23:42,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:42,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:42,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:42,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-15 22:23:42,736 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-15 22:23:42,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:23:42,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2019-11-15 22:23:42,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940460890] [2019-11-15 22:23:42,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:23:42,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:42,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:23:42,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:23:42,738 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 4 states. [2019-11-15 22:23:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:42,815 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-11-15 22:23:42,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:23:42,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-15 22:23:42,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:42,817 INFO L225 Difference]: With dead ends: 120 [2019-11-15 22:23:42,817 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 22:23:42,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 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-15 22:23:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 22:23:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2019-11-15 22:23:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 22:23:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2019-11-15 22:23:42,821 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 32 [2019-11-15 22:23:42,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:42,821 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2019-11-15 22:23:42,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:23:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2019-11-15 22:23:42,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:23:42,822 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:42,822 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] [2019-11-15 22:23:43,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:43,023 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:43,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1891708230, now seen corresponding path program 1 times [2019-11-15 22:23:43,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:43,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413867510] [2019-11-15 22:23:43,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:43,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:43,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:43,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413867510] [2019-11-15 22:23:43,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666196530] [2019-11-15 22:23:43,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:43,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-15 22:23:43,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:43,373 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-15 22:23:43,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:43,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:43,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-11-15 22:23:43,387 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:43,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:43,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:43,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2019-11-15 22:23:43,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:43,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2019-11-15 22:23:43,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:23:43,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:43,602 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:43,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2019-11-15 22:23:43,603 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:23:43,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:43,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:43,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:43,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:43,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-15 22:23:43,626 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:37 [2019-11-15 22:23:43,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:23:43,746 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:23:43,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2019-11-15 22:23:43,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405348426] [2019-11-15 22:23:43,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:23:43,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:23:43,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:23:43,748 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 17 states. [2019-11-15 22:23:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:45,501 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2019-11-15 22:23:45,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:23:45,502 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-11-15 22:23:45,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:45,503 INFO L225 Difference]: With dead ends: 164 [2019-11-15 22:23:45,503 INFO L226 Difference]: Without dead ends: 164 [2019-11-15 22:23:45,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:23:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-15 22:23:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 125. [2019-11-15 22:23:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 22:23:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2019-11-15 22:23:45,508 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 33 [2019-11-15 22:23:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:45,508 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2019-11-15 22:23:45,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:23:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2019-11-15 22:23:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:23:45,509 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:45,510 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] [2019-11-15 22:23:45,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:45,714 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:45,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1338014214, now seen corresponding path program 1 times [2019-11-15 22:23:45,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:45,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283479048] [2019-11-15 22:23:45,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:45,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:45,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:45,974 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-15 22:23:45,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283479048] [2019-11-15 22:23:45,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597634220] [2019-11-15 22:23:45,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:46,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 22:23:46,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:46,151 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:46,152 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-15 22:23:46,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:46,175 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 22:23:46,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:46,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 22:23:46,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:46,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:46,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:46,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:46,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 22:23:46,362 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:46,362 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-15 22:23:46,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:46,389 INFO L567 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-11-15 22:23:46,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:46,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2019-11-15 22:23:46,496 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 22:23:46,496 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 60 treesize of output 79 [2019-11-15 22:23:46,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:23:46,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:46,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:46,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:23:46,532 INFO L567 ElimStorePlain]: treesize reduction 82, result has 29.9 percent of original size [2019-11-15 22:23:46,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:23:46,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-11-15 22:23:46,648 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:46,648 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 36 treesize of output 31 [2019-11-15 22:23:46,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:46,665 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-15 22:23:46,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:23:46,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-15 22:23:46,747 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-15 22:23:46,748 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:23:46,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-11-15 22:23:46,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207666780] [2019-11-15 22:23:46,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 22:23:46,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:46,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 22:23:46,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:23:46,749 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand 23 states. [2019-11-15 22:23:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:47,973 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2019-11-15 22:23:47,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:23:47,973 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2019-11-15 22:23:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:47,974 INFO L225 Difference]: With dead ends: 203 [2019-11-15 22:23:47,974 INFO L226 Difference]: Without dead ends: 203 [2019-11-15 22:23:47,975 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:23:47,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-15 22:23:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 147. [2019-11-15 22:23:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 22:23:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 160 transitions. [2019-11-15 22:23:47,979 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 160 transitions. Word has length 33 [2019-11-15 22:23:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:47,979 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 160 transitions. [2019-11-15 22:23:47,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 22:23:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2019-11-15 22:23:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:23:47,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:47,981 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] [2019-11-15 22:23:48,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:48,186 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:48,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1338014215, now seen corresponding path program 1 times [2019-11-15 22:23:48,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:48,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884966471] [2019-11-15 22:23:48,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:48,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:48,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:48,408 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-15 22:23:48,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884966471] [2019-11-15 22:23:48,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143703632] [2019-11-15 22:23:48,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:48,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 22:23:48,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:48,574 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_49|], 1=[|v_#valid_65|]} [2019-11-15 22:23:48,583 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-15 22:23:48,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:48,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:48,633 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:48,634 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-15 22:23:48,634 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:48,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:48,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:48,643 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 22:23:48,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:48,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:48,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:48,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:48,670 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:48,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:48,695 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-15 22:23:48,695 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 22:23:48,776 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:48,777 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-15 22:23:48,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:48,802 INFO L567 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2019-11-15 22:23:48,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:23:48,806 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:48,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:48,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:48,816 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:38 [2019-11-15 22:23:48,915 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 22:23:48,915 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 102 treesize of output 105 [2019-11-15 22:23:48,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:48,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:48,948 INFO L567 ElimStorePlain]: treesize reduction 32, result has 70.9 percent of original size [2019-11-15 22:23:48,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:48,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2019-11-15 22:23:48,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:48,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:48,965 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-15 22:23:48,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2019-11-15 22:23:49,076 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:49,077 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 47 treesize of output 38 [2019-11-15 22:23:49,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:49,103 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-15 22:23:49,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:23:49,107 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:49,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:49,114 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-15 22:23:49,114 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-15 22:23:49,123 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-15 22:23:49,123 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:23:49,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2019-11-15 22:23:49,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187872324] [2019-11-15 22:23:49,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:23:49,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:49,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:23:49,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:23:49,125 INFO L87 Difference]: Start difference. First operand 147 states and 160 transitions. Second operand 18 states. [2019-11-15 22:23:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:50,352 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2019-11-15 22:23:50,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:23:50,353 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-11-15 22:23:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:50,354 INFO L225 Difference]: With dead ends: 207 [2019-11-15 22:23:50,354 INFO L226 Difference]: Without dead ends: 207 [2019-11-15 22:23:50,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2019-11-15 22:23:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-15 22:23:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 150. [2019-11-15 22:23:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-15 22:23:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2019-11-15 22:23:50,360 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 33 [2019-11-15 22:23:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:50,360 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2019-11-15 22:23:50,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:23:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2019-11-15 22:23:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:23:50,362 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:50,362 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] [2019-11-15 22:23:50,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:50,566 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:50,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1486587456, now seen corresponding path program 1 times [2019-11-15 22:23:50,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:50,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861129239] [2019-11-15 22:23:50,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:50,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:50,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:50,640 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-15 22:23:50,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861129239] [2019-11-15 22:23:50,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79871119] [2019-11-15 22:23:50,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:50,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:23:50,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:50,809 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-15 22:23:50,809 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:23:50,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-15 22:23:50,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479898877] [2019-11-15 22:23:50,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:23:50,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:50,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:23:50,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:23:50,812 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand 7 states. [2019-11-15 22:23:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:51,061 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2019-11-15 22:23:51,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:23:51,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-15 22:23:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:51,063 INFO L225 Difference]: With dead ends: 158 [2019-11-15 22:23:51,063 INFO L226 Difference]: Without dead ends: 135 [2019-11-15 22:23:51,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:23:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-15 22:23:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-15 22:23:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-15 22:23:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2019-11-15 22:23:51,068 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 34 [2019-11-15 22:23:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:51,068 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2019-11-15 22:23:51,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:23:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2019-11-15 22:23:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 22:23:51,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:51,070 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] [2019-11-15 22:23:51,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:51,274 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:51,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:51,274 INFO L82 PathProgramCache]: Analyzing trace with hash -932179340, now seen corresponding path program 2 times [2019-11-15 22:23:51,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:51,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799108576] [2019-11-15 22:23:51,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:51,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:51,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:51,694 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-15 22:23:51,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799108576] [2019-11-15 22:23:51,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045768400] [2019-11-15 22:23:51,695 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:51,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:23:51,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:23:51,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-15 22:23:51,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:52,000 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:52,000 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-15 22:23:52,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:52,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:52,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:52,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 22:23:52,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:52,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:52,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:52,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:52,107 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:52,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:52,127 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-15 22:23:52,127 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-11-15 22:23:52,288 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:23:52,299 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:52,300 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-15 22:23:52,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:52,334 INFO L567 ElimStorePlain]: treesize reduction 19, result has 71.2 percent of original size [2019-11-15 22:23:52,338 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-15 22:23:52,338 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:52,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:52,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:52,359 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:43 [2019-11-15 22:23:52,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:52,415 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:52,415 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 117 treesize of output 98 [2019-11-15 22:23:52,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:52,446 INFO L567 ElimStorePlain]: treesize reduction 16, result has 84.6 percent of original size [2019-11-15 22:23:52,461 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:52,462 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 77 treesize of output 95 [2019-11-15 22:23:52,463 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:52,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:52,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:52,474 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:41 [2019-11-15 22:23:52,718 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:23:52,720 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:23:52,746 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:52,746 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 61 treesize of output 59 [2019-11-15 22:23:52,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:52,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:52,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:52,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:52,751 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:23:52,800 INFO L567 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 22:23:52,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:23:52,813 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:52,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 22:23:52,814 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:52,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:52,827 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-15 22:23:52,828 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:7 [2019-11-15 22:23:52,842 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-15 22:23:52,842 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:23:52,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2019-11-15 22:23:52,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988160429] [2019-11-15 22:23:52,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 22:23:52,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:52,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 22:23:52,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:23:52,846 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 28 states. [2019-11-15 22:23:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:54,199 INFO L93 Difference]: Finished difference Result 191 states and 207 transitions. [2019-11-15 22:23:54,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:23:54,199 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2019-11-15 22:23:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:54,200 INFO L225 Difference]: With dead ends: 191 [2019-11-15 22:23:54,200 INFO L226 Difference]: Without dead ends: 191 [2019-11-15 22:23:54,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 22:23:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-15 22:23:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 137. [2019-11-15 22:23:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 22:23:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2019-11-15 22:23:54,205 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 38 [2019-11-15 22:23:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:54,205 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2019-11-15 22:23:54,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 22:23:54,206 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2019-11-15 22:23:54,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:23:54,206 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:54,206 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] [2019-11-15 22:23:54,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:54,407 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:54,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:54,408 INFO L82 PathProgramCache]: Analyzing trace with hash -17022250, now seen corresponding path program 1 times [2019-11-15 22:23:54,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:54,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237998745] [2019-11-15 22:23:54,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:54,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:54,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:54,677 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-15 22:23:54,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237998745] [2019-11-15 22:23:54,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364715982] [2019-11-15 22:23:54,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:54,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-15 22:23:54,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:54,865 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:54,866 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-15 22:23:54,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:54,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:54,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:54,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 22:23:54,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:54,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:54,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:54,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:54,942 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:54,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:54,954 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-15 22:23:54,954 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-11-15 22:23:55,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:55,096 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-15 22:23:55,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:55,134 INFO L567 ElimStorePlain]: treesize reduction 3, result has 94.1 percent of original size [2019-11-15 22:23:55,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:55,163 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-15 22:23:55,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:55,206 INFO L567 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-11-15 22:23:55,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:55,206 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-11-15 22:23:55,283 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:55,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, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 126 [2019-11-15 22:23:55,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:55,336 INFO L567 ElimStorePlain]: treesize reduction 58, result has 59.4 percent of original size [2019-11-15 22:23:55,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:55,368 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:55,369 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 78 treesize of output 125 [2019-11-15 22:23:55,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:23:55,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:55,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:55,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:55,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:55,373 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2019-11-15 22:23:55,437 INFO L567 ElimStorePlain]: treesize reduction 321, result has 12.8 percent of original size [2019-11-15 22:23:55,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:55,438 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:46 [2019-11-15 22:23:55,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:55,618 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 69 treesize of output 52 [2019-11-15 22:23:55,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:55,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:55,620 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:23:55,644 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2019-11-15 22:23:55,648 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2019-11-15 22:23:55,648 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:55,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:55,659 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-15 22:23:55,659 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:7 [2019-11-15 22:23:55,670 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-15 22:23:55,671 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:23:55,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 25 [2019-11-15 22:23:55,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264677537] [2019-11-15 22:23:55,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 22:23:55,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:23:55,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 22:23:55,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:23:55,674 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand 25 states. [2019-11-15 22:23:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:23:57,344 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2019-11-15 22:23:57,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:23:57,344 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2019-11-15 22:23:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:23:57,346 INFO L225 Difference]: With dead ends: 174 [2019-11-15 22:23:57,346 INFO L226 Difference]: Without dead ends: 171 [2019-11-15 22:23:57,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=1289, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 22:23:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-15 22:23:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2019-11-15 22:23:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-15 22:23:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2019-11-15 22:23:57,351 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 39 [2019-11-15 22:23:57,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:23:57,352 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2019-11-15 22:23:57,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 22:23:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2019-11-15 22:23:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:23:57,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:23:57,353 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] [2019-11-15 22:23:57,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:57,558 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:23:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:23:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1820459137, now seen corresponding path program 1 times [2019-11-15 22:23:57,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:23:57,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776277411] [2019-11-15 22:23:57,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:57,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:23:57,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:23:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:57,877 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-15 22:23:57,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776277411] [2019-11-15 22:23:57,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881239422] [2019-11-15 22:23:57,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:23:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:23:58,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 22:23:58,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:23:58,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:58,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:58,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:58,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:23:58,121 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:58,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:58,131 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-15 22:23:58,132 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-11-15 22:23:58,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:23:58,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:58,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:58,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:58,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-11-15 22:23:58,245 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:58,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-15 22:23:58,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:58,279 INFO L567 ElimStorePlain]: treesize reduction 12, result has 71.4 percent of original size [2019-11-15 22:23:58,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:23:58,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2019-11-15 22:23:58,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:58,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:58,342 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:58,342 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-15 22:23:58,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:58,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:23:58,350 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-15 22:23:58,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:58,421 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.4 percent of original size [2019-11-15 22:23:58,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:23:58,422 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:49 [2019-11-15 22:23:58,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:58,481 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-15 22:23:58,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:58,508 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:58,508 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-15 22:23:58,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:58,582 INFO L567 ElimStorePlain]: treesize reduction 20, result has 78.9 percent of original size [2019-11-15 22:23:58,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:23:58,583 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:75 [2019-11-15 22:23:58,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:58,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:58,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:58,676 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-15 22:23:58,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:58,698 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:58,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 70 [2019-11-15 22:23:58,699 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:58,778 INFO L567 ElimStorePlain]: treesize reduction 29, result has 71.3 percent of original size [2019-11-15 22:23:58,778 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-15 22:23:58,779 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:74 [2019-11-15 22:23:58,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:59,060 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-15 22:23:59,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:59,101 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:59,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 106 [2019-11-15 22:23:59,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:23:59,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:23:59,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,110 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-15 22:23:59,178 INFO L567 ElimStorePlain]: treesize reduction 80, result has 49.0 percent of original size [2019-11-15 22:23:59,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:23:59,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:110, output treesize:78 [2019-11-15 22:23:59,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,239 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_48|], 12=[v_prenex_1]} [2019-11-15 22:23:59,287 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 22:23:59,288 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 68 treesize of output 87 [2019-11-15 22:23:59,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:23:59,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:59,353 INFO L567 ElimStorePlain]: treesize reduction 82, result has 63.1 percent of original size [2019-11-15 22:23:59,425 INFO L341 Elim1Store]: treesize reduction 50, result has 66.2 percent of original size [2019-11-15 22:23:59,425 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 101 treesize of output 144 [2019-11-15 22:23:59,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:23:59,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:23:59,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:23:59,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:59,683 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-11-15 22:23:59,684 INFO L567 ElimStorePlain]: treesize reduction 1631, result has 7.5 percent of original size [2019-11-15 22:23:59,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 22:23:59,685 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:170, output treesize:127 [2019-11-15 22:23:59,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,870 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_4], 5=[|#memory_$Pointer$.base|]} [2019-11-15 22:23:59,883 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:59,883 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 41 treesize of output 36 [2019-11-15 22:23:59,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:23:59,931 INFO L567 ElimStorePlain]: treesize reduction 12, result has 86.7 percent of original size [2019-11-15 22:23:59,953 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:23:59,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 64 [2019-11-15 22:23:59,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:23:59,959 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-15 22:24:00,115 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-11-15 22:24:00,116 INFO L567 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2019-11-15 22:24:00,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:00,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-15 22:24:00,117 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:104, output treesize:52 [2019-11-15 22:24:00,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:00,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:00,253 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-15 22:24:00,253 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:00,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2019-11-15 22:24:00,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157784053] [2019-11-15 22:24:00,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 22:24:00,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:00,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 22:24:00,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=930, Unknown=3, NotChecked=0, Total=1056 [2019-11-15 22:24:00,255 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 33 states. [2019-11-15 22:24:01,632 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 45 [2019-11-15 22:24:02,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:02,655 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2019-11-15 22:24:02,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 22:24:02,655 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2019-11-15 22:24:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:02,657 INFO L225 Difference]: With dead ends: 211 [2019-11-15 22:24:02,657 INFO L226 Difference]: Without dead ends: 211 [2019-11-15 22:24:02,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=467, Invalid=2392, Unknown=3, NotChecked=0, Total=2862 [2019-11-15 22:24:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-15 22:24:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 158. [2019-11-15 22:24:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:24:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2019-11-15 22:24:02,665 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 39 [2019-11-15 22:24:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:02,666 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2019-11-15 22:24:02,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 22:24:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2019-11-15 22:24:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:24:02,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:02,667 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] [2019-11-15 22:24:02,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:02,872 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:24:02,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:02,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1820459136, now seen corresponding path program 1 times [2019-11-15 22:24:02,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:02,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599660913] [2019-11-15 22:24:02,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:02,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:02,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:03,410 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-15 22:24:03,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599660913] [2019-11-15 22:24:03,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27305442] [2019-11-15 22:24:03,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:03,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-15 22:24:03,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:03,641 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_50|], 3=[|v_#valid_71|]} [2019-11-15 22:24:03,645 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-15 22:24:03,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:03,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:03,677 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:03,678 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-15 22:24:03,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:03,711 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-15 22:24:03,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:03,711 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-11-15 22:24:03,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:03,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:03,794 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.4 percent of original size [2019-11-15 22:24:03,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:03,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:03,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:03,830 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-15 22:24:03,830 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:48 [2019-11-15 22:24:03,987 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:03,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:03,998 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 45 treesize of output 48 [2019-11-15 22:24:03,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,044 INFO L567 ElimStorePlain]: treesize reduction 16, result has 79.5 percent of original size [2019-11-15 22:24:04,048 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-15 22:24:04,048 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:04,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,068 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:58 [2019-11-15 22:24:04,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:04,139 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-15 22:24:04,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:04,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:04,176 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-15 22:24:04,176 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:04,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,196 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:54 [2019-11-15 22:24:04,236 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_51|], 3=[|v_#valid_72|]} [2019-11-15 22:24:04,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:04,242 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 12 treesize of output 14 [2019-11-15 22:24:04,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:04,281 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:04,281 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-15 22:24:04,281 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:04,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,303 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-11-15 22:24:04,395 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-15 22:24:04,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:04,424 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-15 22:24:04,425 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,460 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.0 percent of original size [2019-11-15 22:24:04,461 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-15 22:24:04,461 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:83, output treesize:51 [2019-11-15 22:24:04,572 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_45|], 6=[|v_#memory_$Pointer$.base_53|]} [2019-11-15 22:24:04,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:04,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:24:04,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:04,648 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:04,649 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-15 22:24:04,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:04,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:04,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,655 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-15 22:24:04,701 INFO L567 ElimStorePlain]: treesize reduction 56, result has 50.4 percent of original size [2019-11-15 22:24:04,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,701 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:62 [2019-11-15 22:24:04,754 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_46|], 12=[|v_#memory_$Pointer$.base_54|]} [2019-11-15 22:24:04,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:04,762 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-15 22:24:04,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:04,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:04,856 INFO L341 Elim1Store]: treesize reduction 50, result has 66.2 percent of original size [2019-11-15 22:24:04,856 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 124 treesize of output 147 [2019-11-15 22:24:04,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:04,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:04,861 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 22:24:04,914 INFO L567 ElimStorePlain]: treesize reduction 338, result has 21.4 percent of original size [2019-11-15 22:24:04,915 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-15 22:24:04,915 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:177, output treesize:91 [2019-11-15 22:24:05,053 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 5=[|#memory_$Pointer$.base|]} [2019-11-15 22:24:05,057 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-15 22:24:05,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:05,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:05,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:05,107 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 73 treesize of output 63 [2019-11-15 22:24:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:05,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:05,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:05,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:05,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:05,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:05,111 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-15 22:24:05,146 INFO L567 ElimStorePlain]: treesize reduction 28, result has 48.1 percent of original size [2019-11-15 22:24:05,147 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-15 22:24:05,147 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:18 [2019-11-15 22:24:05,266 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-15 22:24:05,266 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:05,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2019-11-15 22:24:05,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055009427] [2019-11-15 22:24:05,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 22:24:05,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:05,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 22:24:05,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:24:05,269 INFO L87 Difference]: Start difference. First operand 158 states and 172 transitions. Second operand 35 states. [2019-11-15 22:24:07,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:07,868 INFO L93 Difference]: Finished difference Result 242 states and 262 transitions. [2019-11-15 22:24:07,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 22:24:07,871 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 39 [2019-11-15 22:24:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:07,873 INFO L225 Difference]: With dead ends: 242 [2019-11-15 22:24:07,874 INFO L226 Difference]: Without dead ends: 242 [2019-11-15 22:24:07,875 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=422, Invalid=2334, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 22:24:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-15 22:24:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 161. [2019-11-15 22:24:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-15 22:24:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2019-11-15 22:24:07,881 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 39 [2019-11-15 22:24:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:07,881 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2019-11-15 22:24:07,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 22:24:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2019-11-15 22:24:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 22:24:07,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:07,883 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] [2019-11-15 22:24:08,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:08,087 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:24:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:08,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1066345776, now seen corresponding path program 1 times [2019-11-15 22:24:08,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:08,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723567166] [2019-11-15 22:24:08,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:08,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:08,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:24:08,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723567166] [2019-11-15 22:24:08,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145024180] [2019-11-15 22:24:08,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:08,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:24:08,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:08,692 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:08,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-11-15 22:24:08,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 22:24:08,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:08,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:08,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:24:08,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2019-11-15 22:24:08,774 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-15 22:24:08,774 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:08,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9] total 25 [2019-11-15 22:24:08,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782660622] [2019-11-15 22:24:08,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 22:24:08,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:08,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 22:24:08,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:24:08,775 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand 25 states. [2019-11-15 22:24:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:10,090 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2019-11-15 22:24:10,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:24:10,091 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2019-11-15 22:24:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:10,092 INFO L225 Difference]: With dead ends: 176 [2019-11-15 22:24:10,092 INFO L226 Difference]: Without dead ends: 176 [2019-11-15 22:24:10,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:24:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-15 22:24:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2019-11-15 22:24:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-15 22:24:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 169 transitions. [2019-11-15 22:24:10,098 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 169 transitions. Word has length 41 [2019-11-15 22:24:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:10,098 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 169 transitions. [2019-11-15 22:24:10,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 22:24:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 169 transitions. [2019-11-15 22:24:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 22:24:10,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:10,099 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] [2019-11-15 22:24:10,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:10,304 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:24:10,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:10,304 INFO L82 PathProgramCache]: Analyzing trace with hash -862473560, now seen corresponding path program 3 times [2019-11-15 22:24:10,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:10,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165033213] [2019-11-15 22:24:10,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:10,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:10,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:10,663 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-15 22:24:10,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165033213] [2019-11-15 22:24:10,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403683913] [2019-11-15 22:24:10,663 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:10,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 22:24:10,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:24:10,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 22:24:10,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:10,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:10,963 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-15 22:24:10,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:10,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:10,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:10,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 22:24:11,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:11,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:11,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:11,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:11,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-15 22:24:11,180 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:11,180 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-15 22:24:11,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:11,203 INFO L567 ElimStorePlain]: treesize reduction 24, result has 52.9 percent of original size [2019-11-15 22:24:11,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:11,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2019-11-15 22:24:11,254 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 22:24:11,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, 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-15 22:24:11,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:11,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:11,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:11,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-11-15 22:24:11,273 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:11,273 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-15 22:24:11,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:11,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:11,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:11,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-15 22:24:11,319 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-15 22:24:11,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:11,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:11,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:11,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2019-11-15 22:24:11,484 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:11,484 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-15 22:24:11,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:11,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:11,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,493 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:11,560 INFO L567 ElimStorePlain]: treesize reduction 52, result has 46.9 percent of original size [2019-11-15 22:24:11,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:11,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2019-11-15 22:24:11,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:11,840 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:11,840 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 91 treesize of output 166 [2019-11-15 22:24:11,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:11,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:11,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:11,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,864 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:11,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:11,904 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:11,904 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 63 treesize of output 94 [2019-11-15 22:24:11,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:11,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:11,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:12,066 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 29 [2019-11-15 22:24:12,066 INFO L567 ElimStorePlain]: treesize reduction 1615, result has 4.9 percent of original size [2019-11-15 22:24:12,066 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-15 22:24:12,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:155, output treesize:81 [2019-11-15 22:24:12,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:12,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:12,205 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:12,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:12,217 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:12,217 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 37 [2019-11-15 22:24:12,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:12,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:12,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:12,255 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 58 treesize of output 68 [2019-11-15 22:24:12,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:12,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:12,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:12,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:12,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:12,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:12,259 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-15 22:24:12,286 INFO L567 ElimStorePlain]: treesize reduction 69, result has 18.8 percent of original size [2019-11-15 22:24:12,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:12,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:101, output treesize:5 [2019-11-15 22:24:12,298 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-15 22:24:12,298 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:12,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2019-11-15 22:24:12,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767961196] [2019-11-15 22:24:12,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 22:24:12,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:12,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 22:24:12,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=871, Unknown=1, NotChecked=0, Total=992 [2019-11-15 22:24:12,300 INFO L87 Difference]: Start difference. First operand 157 states and 169 transitions. Second operand 32 states. [2019-11-15 22:24:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:14,232 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2019-11-15 22:24:14,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 22:24:14,232 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2019-11-15 22:24:14,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:14,233 INFO L225 Difference]: With dead ends: 224 [2019-11-15 22:24:14,233 INFO L226 Difference]: Without dead ends: 224 [2019-11-15 22:24:14,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=435, Invalid=2316, Unknown=5, NotChecked=0, Total=2756 [2019-11-15 22:24:14,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-15 22:24:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 179. [2019-11-15 22:24:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-15 22:24:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2019-11-15 22:24:14,238 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 42 [2019-11-15 22:24:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:14,238 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2019-11-15 22:24:14,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 22:24:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2019-11-15 22:24:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 22:24:14,239 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:14,239 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] [2019-11-15 22:24:14,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:14,446 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:24:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:14,447 INFO L82 PathProgramCache]: Analyzing trace with hash -862473559, now seen corresponding path program 2 times [2019-11-15 22:24:14,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:14,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888708250] [2019-11-15 22:24:14,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:14,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:14,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:14,828 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-15 22:24:14,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888708250] [2019-11-15 22:24:14,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550478224] [2019-11-15 22:24:14,828 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:14,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:24:14,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:24:14,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-15 22:24:14,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:15,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,060 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-15 22:24:15,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,082 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 22:24:15,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 22:24:15,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:15,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,143 INFO L567 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2019-11-15 22:24:15,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:15,147 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,159 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-15 22:24:15,159 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-11-15 22:24:15,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:15,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:24:15,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,318 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,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 36 treesize of output 51 [2019-11-15 22:24:15,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,349 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2019-11-15 22:24:15,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,350 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2019-11-15 22:24:15,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:15,399 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-15 22:24:15,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:15,430 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-15 22:24:15,431 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,451 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-15 22:24:15,515 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_52|], 3=[|v_#valid_76|]} [2019-11-15 22:24:15,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:15,521 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-15 22:24:15,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,569 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,569 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-15 22:24:15,569 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,592 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2019-11-15 22:24:15,655 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-15 22:24:15,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,704 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-15 22:24:15,704 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:15,727 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-15 22:24:15,727 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-11-15 22:24:15,890 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_51|], 6=[|v_#memory_$Pointer$.base_65|]} [2019-11-15 22:24:15,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:15,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:24:15,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:15,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:16,008 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:16,009 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-15 22:24:16,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:16,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:16,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,017 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-15 22:24:16,114 INFO L567 ElimStorePlain]: treesize reduction 60, result has 52.4 percent of original size [2019-11-15 22:24:16,115 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-15 22:24:16,115 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:75 [2019-11-15 22:24:16,190 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_52|], 12=[|v_#memory_$Pointer$.base_66|]} [2019-11-15 22:24:16,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:16,203 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-15 22:24:16,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:16,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:16,361 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-11-15 22:24:16,361 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-15 22:24:16,362 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 134 treesize of output 157 [2019-11-15 22:24:16,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:16,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:16,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:16,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,368 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:16,463 INFO L567 ElimStorePlain]: treesize reduction 753, result has 12.2 percent of original size [2019-11-15 22:24:16,464 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-15 22:24:16,464 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:190, output treesize:104 [2019-11-15 22:24:16,644 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2019-11-15 22:24:16,650 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:16,651 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-15 22:24:16,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:16,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:16,681 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:16,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:16,726 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 100 [2019-11-15 22:24:16,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:16,739 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-15 22:24:16,801 INFO L567 ElimStorePlain]: treesize reduction 60, result has 38.1 percent of original size [2019-11-15 22:24:16,802 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-15 22:24:16,802 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:121, output treesize:18 [2019-11-15 22:24:16,906 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-15 22:24:16,906 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:16,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2019-11-15 22:24:16,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475853200] [2019-11-15 22:24:16,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 22:24:16,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:16,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 22:24:16,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 22:24:16,908 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand 35 states. [2019-11-15 22:24:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:20,439 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2019-11-15 22:24:20,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 22:24:20,439 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2019-11-15 22:24:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:20,440 INFO L225 Difference]: With dead ends: 244 [2019-11-15 22:24:20,440 INFO L226 Difference]: Without dead ends: 244 [2019-11-15 22:24:20,441 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=461, Invalid=2961, Unknown=0, NotChecked=0, Total=3422 [2019-11-15 22:24:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-15 22:24:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 164. [2019-11-15 22:24:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-15 22:24:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2019-11-15 22:24:20,445 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 42 [2019-11-15 22:24:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:20,446 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2019-11-15 22:24:20,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 22:24:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2019-11-15 22:24:20,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 22:24:20,446 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:20,447 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] [2019-11-15 22:24:20,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:20,650 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:24:20,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:20,651 INFO L82 PathProgramCache]: Analyzing trace with hash -982231714, now seen corresponding path program 1 times [2019-11-15 22:24:20,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:20,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351709111] [2019-11-15 22:24:20,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:20,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:20,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:24:20,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351709111] [2019-11-15 22:24:20,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098908851] [2019-11-15 22:24:20,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:20,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 22:24:20,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:21,033 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:21,034 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-15 22:24:21,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:21,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:21,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:21,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-11-15 22:24:21,067 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-15 22:24:21,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:21,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:21,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-15 22:24:21,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2019-11-15 22:24:21,177 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:21,177 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-15 22:24:21,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:21,195 INFO L567 ElimStorePlain]: treesize reduction 24, result has 52.0 percent of original size [2019-11-15 22:24:21,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:21,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:26 [2019-11-15 22:24:21,254 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 22:24:21,254 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-15 22:24:21,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:21,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:21,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:21,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 22:24:21,284 INFO L567 ElimStorePlain]: treesize reduction 80, result has 28.6 percent of original size [2019-11-15 22:24:21,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:21,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:31 [2019-11-15 22:24:21,321 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:21,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-15 22:24:21,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:21,331 INFO L567 ElimStorePlain]: treesize reduction 12, result has 50.0 percent of original size [2019-11-15 22:24:21,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:21,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:8 [2019-11-15 22:24:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:24:21,386 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:21,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2019-11-15 22:24:21,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310386644] [2019-11-15 22:24:21,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 22:24:21,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 22:24:21,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:24:21,387 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand 24 states. [2019-11-15 22:24:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:22,832 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2019-11-15 22:24:22,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:24:22,833 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2019-11-15 22:24:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:22,835 INFO L225 Difference]: With dead ends: 197 [2019-11-15 22:24:22,835 INFO L226 Difference]: Without dead ends: 197 [2019-11-15 22:24:22,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=310, Invalid=1330, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 22:24:22,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-15 22:24:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 173. [2019-11-15 22:24:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-15 22:24:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 185 transitions. [2019-11-15 22:24:22,842 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 185 transitions. Word has length 43 [2019-11-15 22:24:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:22,842 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 185 transitions. [2019-11-15 22:24:22,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 22:24:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 185 transitions. [2019-11-15 22:24:22,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 22:24:22,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:22,843 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] [2019-11-15 22:24:23,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:23,048 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:24:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:23,049 INFO L82 PathProgramCache]: Analyzing trace with hash 366481563, now seen corresponding path program 2 times [2019-11-15 22:24:23,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:23,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499938068] [2019-11-15 22:24:23,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:23,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:23,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:23,619 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-15 22:24:23,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499938068] [2019-11-15 22:24:23,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989912418] [2019-11-15 22:24:23,620 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:23,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:24:23,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:24:23,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-15 22:24:23,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:23,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:23,903 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-15 22:24:23,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:23,942 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 22:24:23,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:23,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 22:24:23,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:23,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:24,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:24,014 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:24,030 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-15 22:24:24,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-15 22:24:24,159 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:24,167 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:24,168 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-15 22:24:24,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,200 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.1 percent of original size [2019-11-15 22:24:24,206 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-15 22:24:24,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:24,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,235 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:49 [2019-11-15 22:24:24,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:24,285 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-15 22:24:24,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:24,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:24,318 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-15 22:24:24,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:24,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-15 22:24:24,373 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:24,373 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-15 22:24:24,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,422 INFO L567 ElimStorePlain]: treesize reduction 28, result has 68.9 percent of original size [2019-11-15 22:24:24,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:62 [2019-11-15 22:24:24,500 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-15 22:24:24,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,551 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.5 percent of original size [2019-11-15 22:24:24,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:24,555 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-15 22:24:24,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:24,573 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-15 22:24:24,574 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:56 [2019-11-15 22:24:24,714 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_57|], 6=[|v_#memory_$Pointer$.base_74|]} [2019-11-15 22:24:24,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:24,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:24:24,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:24,768 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:24,769 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-15 22:24:24,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:24,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:24,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,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-15 22:24:24,817 INFO L567 ElimStorePlain]: treesize reduction 56, result has 52.5 percent of original size [2019-11-15 22:24:24,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,818 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:67 [2019-11-15 22:24:24,872 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_58|], 12=[|v_#memory_$Pointer$.base_75|]} [2019-11-15 22:24:24,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:24,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, 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-15 22:24:24,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:24,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:24,972 INFO L341 Elim1Store]: treesize reduction 50, result has 66.2 percent of original size [2019-11-15 22:24:24,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 5 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 147 [2019-11-15 22:24:24,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:24,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:24,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:24,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:24,977 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 22:24:25,052 INFO L567 ElimStorePlain]: treesize reduction 885, result has 9.9 percent of original size [2019-11-15 22:24:25,052 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-15 22:24:25,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:182, output treesize:96 [2019-11-15 22:24:25,184 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:25,185 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-15 22:24:25,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:25,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:25,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:25,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:113, output treesize:87 [2019-11-15 22:24:25,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:25,367 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:25,368 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 7 new quantified variables, introduced 9 case distinctions, treesize of input 77 treesize of output 94 [2019-11-15 22:24:25,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:25,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:25,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:25,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:25,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:25,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:25,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:25,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:25,374 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:25,413 INFO L567 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-11-15 22:24:25,413 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-15 22:24:25,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:88, output treesize:28 [2019-11-15 22:24:25,618 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-15 22:24:25,618 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:25,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2019-11-15 22:24:25,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260883608] [2019-11-15 22:24:25,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 22:24:25,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:25,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 22:24:25,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1373, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:24:25,620 INFO L87 Difference]: Start difference. First operand 173 states and 185 transitions. Second operand 40 states. [2019-11-15 22:24:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:27,526 INFO L93 Difference]: Finished difference Result 239 states and 257 transitions. [2019-11-15 22:24:27,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 22:24:27,527 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 44 [2019-11-15 22:24:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:27,528 INFO L225 Difference]: With dead ends: 239 [2019-11-15 22:24:27,528 INFO L226 Difference]: Without dead ends: 239 [2019-11-15 22:24:27,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=436, Invalid=2534, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 22:24:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-15 22:24:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 193. [2019-11-15 22:24:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-15 22:24:27,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 210 transitions. [2019-11-15 22:24:27,531 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 210 transitions. Word has length 44 [2019-11-15 22:24:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:27,531 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 210 transitions. [2019-11-15 22:24:27,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 22:24:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 210 transitions. [2019-11-15 22:24:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 22:24:27,532 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:27,532 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] [2019-11-15 22:24:27,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:27,733 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:24:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash 366481564, now seen corresponding path program 2 times [2019-11-15 22:24:27,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:27,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831253322] [2019-11-15 22:24:27,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:27,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:27,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:28,101 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-15 22:24:28,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831253322] [2019-11-15 22:24:28,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360241565] [2019-11-15 22:24:28,102 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:28,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:24:28,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:24:28,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 67 conjunts are in the unsatisfiable core [2019-11-15 22:24:28,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:28,318 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:28,318 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-15 22:24:28,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,348 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 22:24:28,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 22:24:28,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:28,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:28,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:28,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:28,414 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-15 22:24:28,414 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-15 22:24:28,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:28,540 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-15 22:24:28,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:28,569 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:28,570 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-15 22:24:28,570 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,613 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.4 percent of original size [2019-11-15 22:24:28,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,613 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:49 [2019-11-15 22:24:28,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:28,664 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-15 22:24:28,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:28,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:28,685 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-15 22:24:28,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:28,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,699 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-15 22:24:28,701 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_53|], 3=[|v_#valid_81|]} [2019-11-15 22:24:28,704 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-15 22:24:28,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:28,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:28,748 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-15 22:24:28,748 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:28,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:55 [2019-11-15 22:24:28,831 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-15 22:24:28,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,875 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.7 percent of original size [2019-11-15 22:24:28,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:28,880 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-15 22:24:28,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:28,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:28,898 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-15 22:24:28,898 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:53 [2019-11-15 22:24:29,118 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:29,119 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-15 22:24:29,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:29,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:29,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,125 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:29,183 INFO L567 ElimStorePlain]: treesize reduction 56, result has 52.9 percent of original size [2019-11-15 22:24:29,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:29,188 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-15 22:24:29,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:29,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:29,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:29,209 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:64 [2019-11-15 22:24:29,360 INFO L341 Elim1Store]: treesize reduction 50, result has 66.2 percent of original size [2019-11-15 22:24:29,360 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 169 treesize of output 168 [2019-11-15 22:24:29,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:29,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:29,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:29,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:29,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-11-15 22:24:29,493 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-11-15 22:24:29,493 INFO L567 ElimStorePlain]: treesize reduction 1245, result has 9.9 percent of original size [2019-11-15 22:24:29,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:29,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:29,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 99 [2019-11-15 22:24:29,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:29,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:29,541 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-15 22:24:29,541 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:93 [2019-11-15 22:24:29,930 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:29,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:29,965 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:29,965 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 7 new quantified variables, introduced 9 case distinctions, treesize of input 113 treesize of output 118 [2019-11-15 22:24:29,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:29,973 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:30,023 INFO L567 ElimStorePlain]: treesize reduction 44, result has 56.0 percent of original size [2019-11-15 22:24:30,028 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:30,033 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:30,034 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-15 22:24:30,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:30,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:30,047 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-15 22:24:30,047 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:126, output treesize:9 [2019-11-15 22:24:30,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-15 22:24:30,065 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:30,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-11-15 22:24:30,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37723506] [2019-11-15 22:24:30,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 22:24:30,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:30,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 22:24:30,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 22:24:30,066 INFO L87 Difference]: Start difference. First operand 193 states and 210 transitions. Second operand 37 states. [2019-11-15 22:24:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:32,213 INFO L93 Difference]: Finished difference Result 243 states and 262 transitions. [2019-11-15 22:24:32,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 22:24:32,213 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2019-11-15 22:24:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:32,215 INFO L225 Difference]: With dead ends: 243 [2019-11-15 22:24:32,215 INFO L226 Difference]: Without dead ends: 243 [2019-11-15 22:24:32,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=304, Invalid=2246, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 22:24:32,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-15 22:24:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 192. [2019-11-15 22:24:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-15 22:24:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2019-11-15 22:24:32,219 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 44 [2019-11-15 22:24:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:32,220 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2019-11-15 22:24:32,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 22:24:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2019-11-15 22:24:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:24:32,220 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:32,220 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] [2019-11-15 22:24:32,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:32,421 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:24:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:32,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1586760079, now seen corresponding path program 1 times [2019-11-15 22:24:32,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:32,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858947025] [2019-11-15 22:24:32,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:32,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:32,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:32,771 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-15 22:24:32,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858947025] [2019-11-15 22:24:32,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561716321] [2019-11-15 22:24:32,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:32,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-15 22:24:32,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:33,023 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,023 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-15 22:24:33,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 22:24:33,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:33,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:33,081 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,091 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-15 22:24:33,091 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-11-15 22:24:33,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:33,203 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-15 22:24:33,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,228 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,229 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-15 22:24:33,229 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,257 INFO L567 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 22:24:33,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,258 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:39 [2019-11-15 22:24:33,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:33,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-15 22:24:33,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:33,331 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-15 22:24:33,331 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,344 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2019-11-15 22:24:33,348 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-15 22:24:33,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:47 [2019-11-15 22:24:33,442 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 22:24:33,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,464 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 22:24:33,464 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,478 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-15 22:24:33,478 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:41 [2019-11-15 22:24:33,677 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,678 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 41 treesize of output 95 [2019-11-15 22:24:33,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,735 INFO L567 ElimStorePlain]: treesize reduction 63, result has 54.3 percent of original size [2019-11-15 22:24:33,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,763 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 55 treesize of output 84 [2019-11-15 22:24:33,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,769 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-15 22:24:33,824 INFO L567 ElimStorePlain]: treesize reduction 32, result has 67.3 percent of original size [2019-11-15 22:24:33,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:33,825 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:66 [2019-11-15 22:24:33,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:33,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:33,956 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 157 [2019-11-15 22:24:33,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 83 [2019-11-15 22:24:33,976 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:33,994 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 78 treesize of output 62 [2019-11-15 22:24:33,995 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:34,153 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-15 22:24:34,153 INFO L567 ElimStorePlain]: treesize reduction 28, result has 89.8 percent of original size [2019-11-15 22:24:34,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:34,213 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 112 treesize of output 99 [2019-11-15 22:24:34,215 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:34,238 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:34,239 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 77 treesize of output 66 [2019-11-15 22:24:34,239 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:34,248 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 56 treesize of output 47 [2019-11-15 22:24:34,248 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:34,393 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-15 22:24:34,393 INFO L567 ElimStorePlain]: treesize reduction 96, result has 63.2 percent of original size [2019-11-15 22:24:34,394 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-15 22:24:34,394 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:334, output treesize:165 [2019-11-15 22:24:34,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:35,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:35,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:24:35,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:35,227 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 56 [2019-11-15 22:24:35,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:35,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:35,228 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:35,255 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-11-15 22:24:35,255 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 85 [2019-11-15 22:24:35,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:35,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:35,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:35,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:35,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:35,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:35,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:35,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:35,259 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-15 22:24:35,322 INFO L567 ElimStorePlain]: treesize reduction 24, result has 80.2 percent of original size [2019-11-15 22:24:35,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:35,332 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 37 [2019-11-15 22:24:35,332 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:35,338 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:35,339 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 54 treesize of output 45 [2019-11-15 22:24:35,339 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:35,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:35,358 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 2 xjuncts. [2019-11-15 22:24:35,359 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:194, output treesize:26 [2019-11-15 22:24:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:24:35,518 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:35,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2019-11-15 22:24:35,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637178245] [2019-11-15 22:24:35,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-15 22:24:35,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:35,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-15 22:24:35,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1590, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 22:24:35,520 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand 42 states. [2019-11-15 22:24:36,429 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2019-11-15 22:24:36,833 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 55 [2019-11-15 22:24:37,361 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2019-11-15 22:24:37,577 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2019-11-15 22:24:37,873 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 117 [2019-11-15 22:24:38,130 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-11-15 22:24:38,361 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-15 22:24:38,565 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2019-11-15 22:24:38,888 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 126 [2019-11-15 22:24:39,163 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 127 [2019-11-15 22:24:39,383 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 115 [2019-11-15 22:24:39,593 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 116 [2019-11-15 22:24:39,843 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 120 [2019-11-15 22:24:40,045 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 106 [2019-11-15 22:24:40,335 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 106 [2019-11-15 22:24:40,875 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 131 [2019-11-15 22:24:41,239 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 111 [2019-11-15 22:24:41,415 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-11-15 22:24:41,715 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2019-11-15 22:24:41,948 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-11-15 22:24:42,153 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-15 22:24:42,420 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 116 [2019-11-15 22:24:42,612 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2019-11-15 22:24:42,782 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-11-15 22:24:43,077 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 102 [2019-11-15 22:24:43,481 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 127 [2019-11-15 22:24:43,715 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 111 [2019-11-15 22:24:43,935 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-11-15 22:24:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:44,590 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2019-11-15 22:24:44,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-15 22:24:44,590 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 45 [2019-11-15 22:24:44,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:44,592 INFO L225 Difference]: With dead ends: 257 [2019-11-15 22:24:44,592 INFO L226 Difference]: Without dead ends: 257 [2019-11-15 22:24:44,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1014, Invalid=6642, Unknown=0, NotChecked=0, Total=7656 [2019-11-15 22:24:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-15 22:24:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 206. [2019-11-15 22:24:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-15 22:24:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 230 transitions. [2019-11-15 22:24:44,598 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 230 transitions. Word has length 45 [2019-11-15 22:24:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:44,599 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 230 transitions. [2019-11-15 22:24:44,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-15 22:24:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 230 transitions. [2019-11-15 22:24:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:24:44,599 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:44,600 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] [2019-11-15 22:24:44,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:44,801 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:24:44,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:44,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1586760080, now seen corresponding path program 1 times [2019-11-15 22:24:44,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:44,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695036029] [2019-11-15 22:24:44,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:44,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:44,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:45,294 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-15 22:24:45,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695036029] [2019-11-15 22:24:45,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699314990] [2019-11-15 22:24:45,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:45,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-15 22:24:45,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:45,492 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:45,492 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-15 22:24:45,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:45,521 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-15 22:24:45,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:45,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-15 22:24:45,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:45,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:45,610 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-11-15 22:24:45,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:45,614 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:45,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:45,627 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-15 22:24:45,627 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:36 [2019-11-15 22:24:45,815 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:45,816 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-15 22:24:45,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:45,856 INFO L567 ElimStorePlain]: treesize reduction 24, result has 69.2 percent of original size [2019-11-15 22:24:45,864 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-15 22:24:45,864 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:45,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:45,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:45,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:46 [2019-11-15 22:24:45,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:45,961 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-15 22:24:45,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:45,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:45,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:45,989 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-15 22:24:45,989 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:46,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:46,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:46,005 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-15 22:24:46,007 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_54|], 3=[|v_#valid_85|]} [2019-11-15 22:24:46,011 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-15 22:24:46,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:46,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:46,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:46,048 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-15 22:24:46,049 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:46,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:46,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:46,068 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:52 [2019-11-15 22:24:46,129 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-15 22:24:46,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:46,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:46,148 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-15 22:24:46,149 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:46,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:46,162 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-15 22:24:46,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:54 [2019-11-15 22:24:46,319 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:46,319 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-15 22:24:46,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:46,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:46,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,324 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:46,370 INFO L567 ElimStorePlain]: treesize reduction 60, result has 51.6 percent of original size [2019-11-15 22:24:46,373 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-15 22:24:46,373 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:46,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:46,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:46,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:69 [2019-11-15 22:24:46,516 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-15 22:24:46,516 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 177 treesize of output 176 [2019-11-15 22:24:46,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:46,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:46,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:46,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:46,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-11-15 22:24:46,652 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-11-15 22:24:46,652 INFO L567 ElimStorePlain]: treesize reduction 1414, result has 9.2 percent of original size [2019-11-15 22:24:46,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:46,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 107 [2019-11-15 22:24:46,659 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:46,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:46,683 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-15 22:24:46,683 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:184, output treesize:98 [2019-11-15 22:24:47,153 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:47,154 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 126 [2019-11-15 22:24:47,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:47,165 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:47,206 INFO L567 ElimStorePlain]: treesize reduction 68, result has 42.4 percent of original size [2019-11-15 22:24:47,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:47,213 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-15 22:24:47,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:47,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:47,222 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-15 22:24:47,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:128, output treesize:9 [2019-11-15 22:24:47,241 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-15 22:24:47,241 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:47,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2019-11-15 22:24:47,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361237870] [2019-11-15 22:24:47,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 22:24:47,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:47,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 22:24:47,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:24:47,243 INFO L87 Difference]: Start difference. First operand 206 states and 230 transitions. Second operand 34 states. [2019-11-15 22:24:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:49,732 INFO L93 Difference]: Finished difference Result 253 states and 279 transitions. [2019-11-15 22:24:49,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:24:49,732 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2019-11-15 22:24:49,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:49,733 INFO L225 Difference]: With dead ends: 253 [2019-11-15 22:24:49,734 INFO L226 Difference]: Without dead ends: 253 [2019-11-15 22:24:49,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=243, Invalid=2013, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:24:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-15 22:24:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 213. [2019-11-15 22:24:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-15 22:24:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 237 transitions. [2019-11-15 22:24:49,739 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 237 transitions. Word has length 45 [2019-11-15 22:24:49,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:49,739 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 237 transitions. [2019-11-15 22:24:49,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 22:24:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 237 transitions. [2019-11-15 22:24:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:24:49,740 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:49,740 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] [2019-11-15 22:24:49,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:49,944 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:24:49,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:49,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1552050490, now seen corresponding path program 1 times [2019-11-15 22:24:49,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:49,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356653812] [2019-11-15 22:24:49,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:49,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:49,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:50,209 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-15 22:24:50,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356653812] [2019-11-15 22:24:50,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205819582] [2019-11-15 22:24:50,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:50,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-15 22:24:50,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:50,483 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:50,484 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-15 22:24:50,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:50,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:50,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:50,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 22:24:50,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:50,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:50,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:50,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:50,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-15 22:24:50,644 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:50,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-15 22:24:50,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:50,666 INFO L567 ElimStorePlain]: treesize reduction 24, result has 47.8 percent of original size [2019-11-15 22:24:50,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:50,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:22 [2019-11-15 22:24:50,755 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 22:24:50,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, 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 74 [2019-11-15 22:24:50,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:50,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:50,769 INFO L567 ElimStorePlain]: treesize reduction 32, result has 41.8 percent of original size [2019-11-15 22:24:50,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:50,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:23 [2019-11-15 22:24:51,039 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:51,039 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 36 treesize of output 51 [2019-11-15 22:24:51,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:51,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:51,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:51,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:51,040 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:51,060 INFO L567 ElimStorePlain]: treesize reduction 24, result has 50.0 percent of original size [2019-11-15 22:24:51,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:51,061 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-15 22:24:51,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:27 [2019-11-15 22:24:51,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:51,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:51,157 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-15 22:24:51,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:51,167 INFO L567 ElimStorePlain]: treesize reduction 18, result has 37.9 percent of original size [2019-11-15 22:24:51,168 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-15 22:24:51,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2019-11-15 22:24:51,203 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-15 22:24:51,203 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:51,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-11-15 22:24:51,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591345160] [2019-11-15 22:24:51,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 22:24:51,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:51,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 22:24:51,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:24:51,204 INFO L87 Difference]: Start difference. First operand 213 states and 237 transitions. Second operand 32 states. [2019-11-15 22:24:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:52,740 INFO L93 Difference]: Finished difference Result 232 states and 257 transitions. [2019-11-15 22:24:52,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:24:52,740 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 47 [2019-11-15 22:24:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:52,741 INFO L225 Difference]: With dead ends: 232 [2019-11-15 22:24:52,741 INFO L226 Difference]: Without dead ends: 232 [2019-11-15 22:24:52,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=300, Invalid=1956, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:24:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-15 22:24:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2019-11-15 22:24:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-15 22:24:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 239 transitions. [2019-11-15 22:24:52,746 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 239 transitions. Word has length 47 [2019-11-15 22:24:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:52,747 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 239 transitions. [2019-11-15 22:24:52,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 22:24:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 239 transitions. [2019-11-15 22:24:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:24:52,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:52,747 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] [2019-11-15 22:24:52,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:52,948 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:24:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:52,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1552050491, now seen corresponding path program 1 times [2019-11-15 22:24:52,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:52,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691773215] [2019-11-15 22:24:52,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:52,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:52,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:53,229 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-15 22:24:53,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691773215] [2019-11-15 22:24:53,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530783796] [2019-11-15 22:24:53,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:53,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 22:24:53,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:53,524 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:53,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-11-15 22:24:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:53,525 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:53,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:53,545 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:53,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2019-11-15 22:24:53,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:53,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 22:24:53,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:53,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:53,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:53,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:53,562 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 4 xjuncts. [2019-11-15 22:24:53,562 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:60 [2019-11-15 22:24:53,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:53,706 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-15 22:24:53,706 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:53,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 26 [2019-11-15 22:24:53,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631262705] [2019-11-15 22:24:53,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 22:24:53,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:53,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 22:24:53,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:24:53,707 INFO L87 Difference]: Start difference. First operand 214 states and 239 transitions. Second operand 27 states. [2019-11-15 22:24:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:24:56,390 INFO L93 Difference]: Finished difference Result 247 states and 274 transitions. [2019-11-15 22:24:56,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 22:24:56,390 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2019-11-15 22:24:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:24:56,391 INFO L225 Difference]: With dead ends: 247 [2019-11-15 22:24:56,392 INFO L226 Difference]: Without dead ends: 247 [2019-11-15 22:24:56,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=545, Invalid=2647, Unknown=0, NotChecked=0, Total=3192 [2019-11-15 22:24:56,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-11-15 22:24:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 224. [2019-11-15 22:24:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-15 22:24:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 251 transitions. [2019-11-15 22:24:56,397 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 251 transitions. Word has length 47 [2019-11-15 22:24:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:24:56,398 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 251 transitions. [2019-11-15 22:24:56,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 22:24:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 251 transitions. [2019-11-15 22:24:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:24:56,399 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:24:56,399 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] [2019-11-15 22:24:56,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:56,602 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:24:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:24:56,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1573711634, now seen corresponding path program 4 times [2019-11-15 22:24:56,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:24:56,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823819259] [2019-11-15 22:24:56,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:56,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:24:56,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:24:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:24:56,961 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-15 22:24:56,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823819259] [2019-11-15 22:24:56,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089481786] [2019-11-15 22:24:56,961 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:24:57,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:24:57,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:24:57,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-15 22:24:57,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:24:57,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,128 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-15 22:24:57,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,147 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-15 22:24:57,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-15 22:24:57,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:57,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:24:57,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,215 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-15 22:24:57,215 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2019-11-15 22:24:57,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:57,326 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-15 22:24:57,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,355 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-15 22:24:57,356 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,384 INFO L567 ElimStorePlain]: treesize reduction 24, result has 65.7 percent of original size [2019-11-15 22:24:57,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,384 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:46 [2019-11-15 22:24:57,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:57,431 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-15 22:24:57,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:57,453 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-15 22:24:57,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,466 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-15 22:24:57,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,491 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-15 22:24:57,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,535 INFO L567 ElimStorePlain]: treesize reduction 28, result has 67.8 percent of original size [2019-11-15 22:24:57,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:59 [2019-11-15 22:24:57,587 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-15 22:24:57,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,610 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-15 22:24:57,611 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,628 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-15 22:24:57,628 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-11-15 22:24:57,765 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_81|], 6=[|v_#memory_$Pointer$.base_101|]} [2019-11-15 22:24:57,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:57,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:24:57,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,829 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:57,830 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-15 22:24:57,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:57,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:57,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:57,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:57,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:57,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:57,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:57,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:57,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:57,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:57,834 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-15 22:24:57,894 INFO L567 ElimStorePlain]: treesize reduction 60, result has 51.2 percent of original size [2019-11-15 22:24:57,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,894 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:72 [2019-11-15 22:24:57,946 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_82|], 12=[|v_#memory_$Pointer$.base_102|]} [2019-11-15 22:24:57,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:24:57,950 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-15 22:24:57,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:57,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:58,050 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-15 22:24:58,050 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 132 treesize of output 155 [2019-11-15 22:24:58,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:24:58,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,053 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 22:24:58,101 INFO L567 ElimStorePlain]: treesize reduction 366, result has 21.8 percent of original size [2019-11-15 22:24:58,101 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-15 22:24:58,102 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:187, output treesize:101 [2019-11-15 22:24:58,214 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-15 22:24:58,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:24:58,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:58,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:58,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:115, output treesize:89 [2019-11-15 22:24:58,344 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:24:58,344 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 85 treesize of output 71 [2019-11-15 22:24:58,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:24:58,347 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:24:58,369 INFO L567 ElimStorePlain]: treesize reduction 36, result has 43.8 percent of original size [2019-11-15 22:24:58,369 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-15 22:24:58,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2019-11-15 22:24:58,469 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-15 22:24:58,470 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:24:58,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2019-11-15 22:24:58,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944564449] [2019-11-15 22:24:58,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 22:24:58,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:24:58,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 22:24:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 22:24:58,472 INFO L87 Difference]: Start difference. First operand 224 states and 251 transitions. Second operand 37 states. [2019-11-15 22:25:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:00,548 INFO L93 Difference]: Finished difference Result 279 states and 309 transitions. [2019-11-15 22:25:00,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 22:25:00,548 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2019-11-15 22:25:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:00,549 INFO L225 Difference]: With dead ends: 279 [2019-11-15 22:25:00,549 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 22:25:00,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=344, Invalid=2206, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 22:25:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 22:25:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 228. [2019-11-15 22:25:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-15 22:25:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 257 transitions. [2019-11-15 22:25:00,554 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 257 transitions. Word has length 47 [2019-11-15 22:25:00,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:00,555 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 257 transitions. [2019-11-15 22:25:00,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 22:25:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 257 transitions. [2019-11-15 22:25:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:25:00,556 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:00,556 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] [2019-11-15 22:25:00,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:00,760 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:25:00,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:00,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1573711635, now seen corresponding path program 3 times [2019-11-15 22:25:00,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:00,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751412351] [2019-11-15 22:25:00,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:00,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:00,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:01,313 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-15 22:25:01,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751412351] [2019-11-15 22:25:01,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043643352] [2019-11-15 22:25:01,314 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:01,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 22:25:01,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:25:01,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-15 22:25:01,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:01,630 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:01,630 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-15 22:25:01,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:01,652 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 22:25:01,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:01,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 22:25:01,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:25:01,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:01,718 INFO L567 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2019-11-15 22:25:01,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:25:01,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:01,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:01,732 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-15 22:25:01,732 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-11-15 22:25:01,852 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:01,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:01,862 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-15 22:25:01,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:01,896 INFO L567 ElimStorePlain]: treesize reduction 16, result has 78.1 percent of original size [2019-11-15 22:25:01,899 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-15 22:25:01,899 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:01,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:01,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:01,913 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:49 [2019-11-15 22:25:01,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:01,964 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-15 22:25:01,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:01,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:01,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:01,985 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-15 22:25:01,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:01,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:01,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:01,998 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-15 22:25:02,000 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 3=[|v_#valid_91|]} [2019-11-15 22:25:02,003 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-15 22:25:02,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:02,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:02,033 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:02,033 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-15 22:25:02,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:02,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:02,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:02,051 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:55 [2019-11-15 22:25:02,106 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-15 22:25:02,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:02,142 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.7 percent of original size [2019-11-15 22:25:02,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:02,146 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-15 22:25:02,147 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:02,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:02,162 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-15 22:25:02,162 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:53 [2019-11-15 22:25:02,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:02,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:02,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:02,300 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-15 22:25:02,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:02,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:02,354 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:02,355 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-15 22:25:02,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:02,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:02,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,359 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-15 22:25:02,406 INFO L567 ElimStorePlain]: treesize reduction 56, result has 51.3 percent of original size [2019-11-15 22:25:02,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:02,407 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:64 [2019-11-15 22:25:02,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:02,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:02,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 43 [2019-11-15 22:25:02,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:02,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:02,553 INFO L341 Elim1Store]: treesize reduction 50, result has 66.2 percent of original size [2019-11-15 22:25:02,553 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 126 treesize of output 149 [2019-11-15 22:25:02,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:02,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:02,597 INFO L567 ElimStorePlain]: treesize reduction 320, result has 22.7 percent of original size [2019-11-15 22:25:02,597 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-15 22:25:02,598 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:93 [2019-11-15 22:25:02,855 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:02,856 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:02,883 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:02,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 7 new quantified variables, introduced 9 case distinctions, treesize of input 113 treesize of output 118 [2019-11-15 22:25:02,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:02,891 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:02,929 INFO L567 ElimStorePlain]: treesize reduction 44, result has 56.0 percent of original size [2019-11-15 22:25:02,932 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:02,935 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:02,935 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-15 22:25:02,936 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:02,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:02,945 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-15 22:25:02,945 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:126, output treesize:9 [2019-11-15 22:25:02,961 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-15 22:25:02,962 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:25:02,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-11-15 22:25:02,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797021217] [2019-11-15 22:25:02,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 22:25:02,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:02,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 22:25:02,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 22:25:02,963 INFO L87 Difference]: Start difference. First operand 228 states and 257 transitions. Second operand 37 states. [2019-11-15 22:25:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:05,338 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2019-11-15 22:25:05,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 22:25:05,338 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2019-11-15 22:25:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:05,340 INFO L225 Difference]: With dead ends: 283 [2019-11-15 22:25:05,340 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 22:25:05,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=304, Invalid=2246, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 22:25:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 22:25:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 229. [2019-11-15 22:25:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-15 22:25:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2019-11-15 22:25:05,346 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 47 [2019-11-15 22:25:05,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:05,346 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2019-11-15 22:25:05,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 22:25:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2019-11-15 22:25:05,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:25:05,347 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:05,347 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] [2019-11-15 22:25:05,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:05,548 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:25:05,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:05,548 INFO L82 PathProgramCache]: Analyzing trace with hash 356186616, now seen corresponding path program 2 times [2019-11-15 22:25:05,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:05,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621538051] [2019-11-15 22:25:05,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:05,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:05,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:05,913 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-15 22:25:05,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621538051] [2019-11-15 22:25:05,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890476224] [2019-11-15 22:25:05,914 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:06,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:25:06,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:25:06,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-15 22:25:06,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:06,160 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:06,160 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-15 22:25:06,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,180 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-15 22:25:06,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-15 22:25:06,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:25:06,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,251 INFO L567 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2019-11-15 22:25:06,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:25:06,255 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:06,268 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-15 22:25:06,268 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:32 [2019-11-15 22:25:06,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:06,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:25:06,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:06,434 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:06,434 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-15 22:25:06,435 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,467 INFO L567 ElimStorePlain]: treesize reduction 24, result has 65.7 percent of original size [2019-11-15 22:25:06,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:46 [2019-11-15 22:25:06,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:06,530 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-15 22:25:06,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:06,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:06,569 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-15 22:25:06,570 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:06,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,587 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2019-11-15 22:25:06,624 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:06,624 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-15 22:25:06,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,670 INFO L567 ElimStorePlain]: treesize reduction 28, result has 67.8 percent of original size [2019-11-15 22:25:06,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:59 [2019-11-15 22:25:06,728 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-15 22:25:06,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:06,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 21 [2019-11-15 22:25:06,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:06,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:06,772 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-15 22:25:06,772 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:57 [2019-11-15 22:25:06,914 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_93|], 6=[|v_#memory_$Pointer$.base_113|]} [2019-11-15 22:25:06,948 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:06,949 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-15 22:25:06,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:06,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:06,950 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:06,995 INFO L567 ElimStorePlain]: treesize reduction 24, result has 81.1 percent of original size [2019-11-15 22:25:07,031 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:07,032 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-15 22:25:07,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:07,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:07,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,036 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-15 22:25:07,093 INFO L567 ElimStorePlain]: treesize reduction 60, result has 52.4 percent of original size [2019-11-15 22:25:07,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:07,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:72 [2019-11-15 22:25:07,150 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_94|], 12=[|v_#memory_$Pointer$.base_114|]} [2019-11-15 22:25:07,186 INFO L341 Elim1Store]: treesize reduction 46, result has 55.3 percent of original size [2019-11-15 22:25:07,187 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 202 treesize of output 193 [2019-11-15 22:25:07,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:07,230 INFO L567 ElimStorePlain]: treesize reduction 48, result has 78.2 percent of original size [2019-11-15 22:25:07,366 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-11-15 22:25:07,366 INFO L341 Elim1Store]: treesize reduction 54, result has 69.3 percent of original size [2019-11-15 22:25:07,367 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 175 [2019-11-15 22:25:07,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:07,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:07,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:07,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:07,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,377 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 22:25:07,492 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-11-15 22:25:07,492 INFO L567 ElimStorePlain]: treesize reduction 1229, result has 8.8 percent of original size [2019-11-15 22:25:07,492 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-15 22:25:07,493 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:227, output treesize:117 [2019-11-15 22:25:07,698 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:07,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:07,706 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 86 [2019-11-15 22:25:07,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:07,762 INFO L567 ElimStorePlain]: treesize reduction 20, result has 82.1 percent of original size [2019-11-15 22:25:07,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:07,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:134, output treesize:92 [2019-11-15 22:25:07,952 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:07,996 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:07,996 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 7 new quantified variables, introduced 9 case distinctions, treesize of input 85 treesize of output 106 [2019-11-15 22:25:07,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:07,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:08,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:08,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:08,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:08,001 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:08,040 INFO L567 ElimStorePlain]: treesize reduction 36, result has 48.6 percent of original size [2019-11-15 22:25:08,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:08,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:96, output treesize:28 [2019-11-15 22:25:08,162 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-15 22:25:08,162 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:25:08,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2019-11-15 22:25:08,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799543134] [2019-11-15 22:25:08,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 22:25:08,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:08,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 22:25:08,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1375, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 22:25:08,164 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand 40 states. [2019-11-15 22:25:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:10,387 INFO L93 Difference]: Finished difference Result 280 states and 311 transitions. [2019-11-15 22:25:10,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 22:25:10,388 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 48 [2019-11-15 22:25:10,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:10,389 INFO L225 Difference]: With dead ends: 280 [2019-11-15 22:25:10,389 INFO L226 Difference]: Without dead ends: 280 [2019-11-15 22:25:10,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=417, Invalid=2445, Unknown=0, NotChecked=0, Total=2862 [2019-11-15 22:25:10,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-15 22:25:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 229. [2019-11-15 22:25:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-15 22:25:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2019-11-15 22:25:10,394 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 48 [2019-11-15 22:25:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:10,394 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2019-11-15 22:25:10,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 22:25:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2019-11-15 22:25:10,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:25:10,395 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:10,395 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] [2019-11-15 22:25:10,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:10,596 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:25:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:10,596 INFO L82 PathProgramCache]: Analyzing trace with hash 356186617, now seen corresponding path program 1 times [2019-11-15 22:25:10,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:10,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420875260] [2019-11-15 22:25:10,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:10,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:10,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:10,959 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-15 22:25:10,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420875260] [2019-11-15 22:25:10,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213445846] [2019-11-15 22:25:10,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:11,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-15 22:25:11,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:11,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,143 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-15 22:25:11,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,167 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-15 22:25:11,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-15 22:25:11,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:25:11,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:25:11,228 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,240 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-15 22:25:11,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2019-11-15 22:25:11,364 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-15 22:25:11,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,398 INFO L567 ElimStorePlain]: treesize reduction 24, result has 69.2 percent of original size [2019-11-15 22:25:11,402 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-15 22:25:11,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,415 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:50 [2019-11-15 22:25:11,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:11,466 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-15 22:25:11,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:11,487 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-15 22:25:11,488 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,501 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:50 [2019-11-15 22:25:11,502 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_56|], 3=[|v_#valid_95|]} [2019-11-15 22:25:11,506 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-15 22:25:11,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,538 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,538 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-15 22:25:11,539 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,555 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2019-11-15 22:25:11,602 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-15 22:25:11,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,622 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-15 22:25:11,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,636 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-15 22:25:11,636 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:58 [2019-11-15 22:25:11,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,799 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 102 treesize of output 147 [2019-11-15 22:25:11,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,846 INFO L567 ElimStorePlain]: treesize reduction 60, result has 61.8 percent of original size [2019-11-15 22:25:11,882 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:11,882 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-15 22:25:11,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:11,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:11,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:11,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:11,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:11,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:11,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:11,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:11,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:11,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:11,887 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-15 22:25:11,970 INFO L567 ElimStorePlain]: treesize reduction 60, result has 50.0 percent of original size [2019-11-15 22:25:11,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:11,970 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:69 [2019-11-15 22:25:12,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:12,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 43 [2019-11-15 22:25:12,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:12,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:12,140 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-15 22:25:12,140 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 134 treesize of output 157 [2019-11-15 22:25:12,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,142 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:12,186 INFO L567 ElimStorePlain]: treesize reduction 100, result has 49.5 percent of original size [2019-11-15 22:25:12,186 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-15 22:25:12,187 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:184, output treesize:98 [2019-11-15 22:25:12,468 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:12,468 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 126 [2019-11-15 22:25:12,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:12,473 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:12,507 INFO L567 ElimStorePlain]: treesize reduction 68, result has 42.4 percent of original size [2019-11-15 22:25:12,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:12,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 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-15 22:25:12,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:12,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:12,520 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-15 22:25:12,521 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:128, output treesize:9 [2019-11-15 22:25:12,546 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-15 22:25:12,547 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:25:12,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2019-11-15 22:25:12,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949439638] [2019-11-15 22:25:12,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 22:25:12,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:12,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 22:25:12,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 22:25:12,548 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand 34 states. [2019-11-15 22:25:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:14,788 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2019-11-15 22:25:14,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 22:25:14,788 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-11-15 22:25:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:14,789 INFO L225 Difference]: With dead ends: 283 [2019-11-15 22:25:14,789 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 22:25:14,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=243, Invalid=2013, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:25:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 22:25:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 229. [2019-11-15 22:25:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-15 22:25:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2019-11-15 22:25:14,794 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 48 [2019-11-15 22:25:14,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:14,794 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2019-11-15 22:25:14,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 22:25:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2019-11-15 22:25:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:25:14,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:14,795 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] [2019-11-15 22:25:14,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:14,996 INFO L410 AbstractCegarLoop]: === Iteration 37 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:25:14,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:14,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1447250271, now seen corresponding path program 1 times [2019-11-15 22:25:14,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:14,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753085203] [2019-11-15 22:25:14,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:14,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:14,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:15,435 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-15 22:25:15,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753085203] [2019-11-15 22:25:15,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748233622] [2019-11-15 22:25:15,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:15,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-15 22:25:15,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:15,657 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:15,658 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-15 22:25:15,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:15,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:15,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:15,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 22:25:15,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:25:15,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:15,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:15,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:15,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-15 22:25:15,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:15,783 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-15 22:25:15,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:15,799 INFO L567 ElimStorePlain]: treesize reduction 24, result has 50.0 percent of original size [2019-11-15 22:25:15,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:15,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:24 [2019-11-15 22:25:15,840 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 22:25:15,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, 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-15 22:25:15,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:15,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:15,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:15,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2019-11-15 22:25:15,867 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:15,867 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-15 22:25:15,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:15,891 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-11-15 22:25:15,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:15,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2019-11-15 22:25:15,928 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-15 22:25:15,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:15,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:15,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:15,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:39 [2019-11-15 22:25:16,083 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:16,084 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-15 22:25:16,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:16,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:16,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:16,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:16,087 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:16,130 INFO L567 ElimStorePlain]: treesize reduction 52, result has 50.5 percent of original size [2019-11-15 22:25:16,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:16,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:58 [2019-11-15 22:25:16,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:16,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:16,302 INFO L341 Elim1Store]: treesize reduction 24, result has 63.6 percent of original size [2019-11-15 22:25:16,302 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 69 treesize of output 88 [2019-11-15 22:25:16,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:16,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:16,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 65 treesize of output 44 [2019-11-15 22:25:16,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:16,363 INFO L567 ElimStorePlain]: treesize reduction 54, result has 59.7 percent of original size [2019-11-15 22:25:16,363 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-15 22:25:16,364 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:135, output treesize:80 [2019-11-15 22:25:16,419 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:16,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:16,451 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 57 treesize of output 115 [2019-11-15 22:25:16,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:16,535 INFO L341 Elim1Store]: treesize reduction 12, result has 89.5 percent of original size [2019-11-15 22:25:16,536 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 61 treesize of output 149 [2019-11-15 22:25:16,536 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:16,638 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-11-15 22:25:16,638 INFO L567 ElimStorePlain]: treesize reduction 74, result has 67.0 percent of original size [2019-11-15 22:25:16,638 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-15 22:25:16,638 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:150 [2019-11-15 22:25:16,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:16,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:16,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:16,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:16,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:16,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:16,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 84 [2019-11-15 22:25:16,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:16,781 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:16,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, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 119 [2019-11-15 22:25:16,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:16,879 INFO L567 ElimStorePlain]: treesize reduction 108, result has 51.4 percent of original size [2019-11-15 22:25:16,880 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-15 22:25:16,880 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:148, output treesize:128 [2019-11-15 22:25:16,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,311 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:17,311 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 151 treesize of output 186 [2019-11-15 22:25:17,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,379 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:17,438 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:17,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, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 115 [2019-11-15 22:25:17,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,442 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-15 22:25:17,571 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2019-11-15 22:25:17,572 INFO L567 ElimStorePlain]: treesize reduction 168, result has 41.5 percent of original size [2019-11-15 22:25:17,572 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 2 xjuncts. [2019-11-15 22:25:17,572 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:238, output treesize:158 [2019-11-15 22:25:17,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:17,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:17,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 199 treesize of output 270 [2019-11-15 22:25:17,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:17,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:17,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,404 INFO L496 ElimStorePlain]: Start of recursive call 2: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:18,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:18,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:18,534 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 122 treesize of output 177 [2019-11-15 22:25:18,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:18,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:18,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:19,239 WARN L191 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 479 DAG size of output: 53 [2019-11-15 22:25:19,239 INFO L567 ElimStorePlain]: treesize reduction 6884, result has 3.2 percent of original size [2019-11-15 22:25:19,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-15 22:25:19,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:322, output treesize:224 [2019-11-15 22:25:19,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,620 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 97 treesize of output 85 [2019-11-15 22:25:19,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:19,625 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 162 treesize of output 150 [2019-11-15 22:25:19,625 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:19,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:19,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-15 22:25:19,691 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:260, output treesize:230 [2019-11-15 22:25:19,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,861 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:19,861 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 86 treesize of output 76 [2019-11-15 22:25:19,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,864 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:19,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:19,901 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 128 [2019-11-15 22:25:19,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:19,916 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-15 22:25:20,000 INFO L567 ElimStorePlain]: treesize reduction 100, result has 43.8 percent of original size [2019-11-15 22:25:20,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-15 22:25:20,001 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:238, output treesize:78 [2019-11-15 22:25:20,126 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-15 22:25:20,127 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:25:20,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 47 [2019-11-15 22:25:20,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285672224] [2019-11-15 22:25:20,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-15 22:25:20,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:20,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-15 22:25:20,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=2012, Unknown=7, NotChecked=0, Total=2256 [2019-11-15 22:25:20,128 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand 48 states. [2019-11-15 22:25:21,500 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2019-11-15 22:25:21,983 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-11-15 22:25:22,704 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-11-15 22:25:22,934 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-11-15 22:25:23,426 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-11-15 22:25:23,963 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 70 [2019-11-15 22:25:24,425 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 72 [2019-11-15 22:25:25,163 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2019-11-15 22:25:25,817 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-11-15 22:25:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:26,836 INFO L93 Difference]: Finished difference Result 358 states and 396 transitions. [2019-11-15 22:25:26,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-11-15 22:25:26,836 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-11-15 22:25:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:26,838 INFO L225 Difference]: With dead ends: 358 [2019-11-15 22:25:26,838 INFO L226 Difference]: Without dead ends: 358 [2019-11-15 22:25:26,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1355, Invalid=7566, Unknown=9, NotChecked=0, Total=8930 [2019-11-15 22:25:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-15 22:25:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 251. [2019-11-15 22:25:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-15 22:25:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 283 transitions. [2019-11-15 22:25:26,844 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 283 transitions. Word has length 48 [2019-11-15 22:25:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:26,845 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 283 transitions. [2019-11-15 22:25:26,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-11-15 22:25:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 283 transitions. [2019-11-15 22:25:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:25:26,846 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:26,846 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] [2019-11-15 22:25:27,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:27,051 INFO L410 AbstractCegarLoop]: === Iteration 38 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:25:27,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:27,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1447250270, now seen corresponding path program 1 times [2019-11-15 22:25:27,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:27,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592391308] [2019-11-15 22:25:27,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:27,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:27,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:27,731 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-15 22:25:27,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592391308] [2019-11-15 22:25:27,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580440950] [2019-11-15 22:25:27,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:27,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-15 22:25:27,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:27,993 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 3=[|v_#valid_99|]} [2019-11-15 22:25:27,996 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-15 22:25:27,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:28,022 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:28,022 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-15 22:25:28,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,046 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-11-15 22:25:28,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,047 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 22:25:28,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:25:28,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,110 INFO L567 ElimStorePlain]: treesize reduction 5, result has 89.8 percent of original size [2019-11-15 22:25:28,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:25:28,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:28,125 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-15 22:25:28,126 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:45 [2019-11-15 22:25:28,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:28,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:25:28,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:28,263 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:28,263 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 45 treesize of output 56 [2019-11-15 22:25:28,264 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,293 INFO L567 ElimStorePlain]: treesize reduction 24, result has 66.7 percent of original size [2019-11-15 22:25:28,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:48 [2019-11-15 22:25:28,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:28,363 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-15 22:25:28,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:28,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:28,399 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-15 22:25:28,400 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:28,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,418 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:48 [2019-11-15 22:25:28,420 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_58|], 6=[|v_#valid_100|]} [2019-11-15 22:25:28,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:28,426 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 12 treesize of output 14 [2019-11-15 22:25:28,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:28,498 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:28,498 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-15 22:25:28,499 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,581 INFO L567 ElimStorePlain]: treesize reduction 28, result has 70.2 percent of original size [2019-11-15 22:25:28,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,582 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:66 [2019-11-15 22:25:28,683 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-15 22:25:28,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:28,729 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-15 22:25:28,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:28,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:28,758 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-15 22:25:28,758 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:68 [2019-11-15 22:25:28,979 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_105|], 6=[|v_#memory_$Pointer$.base_134|]} [2019-11-15 22:25:28,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:28,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:25:28,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:29,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:29,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:29,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 103 treesize of output 120 [2019-11-15 22:25:29,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:29,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:29,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-15 22:25:29,141 INFO L567 ElimStorePlain]: treesize reduction 60, result has 54.9 percent of original size [2019-11-15 22:25:29,142 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-15 22:25:29,142 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:86 [2019-11-15 22:25:29,205 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_106|], 12=[|v_#memory_$Pointer$.base_135|]} [2019-11-15 22:25:29,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:29,209 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-15 22:25:29,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:29,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:29,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:29,279 INFO L341 Elim1Store]: treesize reduction 24, result has 63.6 percent of original size [2019-11-15 22:25:29,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, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 83 [2019-11-15 22:25:29,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:29,328 INFO L567 ElimStorePlain]: treesize reduction 54, result has 61.4 percent of original size [2019-11-15 22:25:29,329 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-15 22:25:29,329 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:124, output treesize:86 [2019-11-15 22:25:29,330 INFO L392 ElimStorePlain]: Different costs {3=[|v_#length_59|], 6=[|v_#valid_101|]} [2019-11-15 22:25:29,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:29,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:29,335 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 21 treesize of output 26 [2019-11-15 22:25:29,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:29,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:29,376 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:29,377 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-15 22:25:29,377 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:29,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:29,399 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-15 22:25:29,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:88 [2019-11-15 22:25:29,460 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_107|], 12=[|v_#memory_$Pointer$.base_136|]} [2019-11-15 22:25:29,464 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-15 22:25:29,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:29,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:29,518 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:29,518 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 63 treesize of output 96 [2019-11-15 22:25:29,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:29,574 INFO L567 ElimStorePlain]: treesize reduction 72, result has 55.0 percent of original size [2019-11-15 22:25:29,574 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-15 22:25:29,575 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:110, output treesize:90 [2019-11-15 22:25:29,733 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_108|], 12=[|v_#memory_$Pointer$.base_137|]} [2019-11-15 22:25:29,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:29,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:25:29,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:29,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:29,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:29,828 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 162 treesize of output 185 [2019-11-15 22:25:29,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:29,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:29,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:29,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:29,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:29,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:29,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:29,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:29,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:29,836 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-15 22:25:29,908 INFO L567 ElimStorePlain]: treesize reduction 116, result has 45.0 percent of original size [2019-11-15 22:25:29,909 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-15 22:25:29,909 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:180, output treesize:124 [2019-11-15 22:25:29,973 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_109|], 20=[|v_#memory_$Pointer$.base_138|]} [2019-11-15 22:25:29,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:29,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, 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-15 22:25:29,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:30,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:30,207 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-11-15 22:25:30,208 INFO L341 Elim1Store]: treesize reduction 62, result has 72.9 percent of original size [2019-11-15 22:25:30,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 229 treesize of output 240 [2019-11-15 22:25:30,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:30,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:30,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:30,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:30,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 22:25:30,315 INFO L567 ElimStorePlain]: treesize reduction 2268, result has 7.5 percent of original size [2019-11-15 22:25:30,315 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-15 22:25:30,316 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:291, output treesize:181 [2019-11-15 22:25:30,446 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2019-11-15 22:25:30,450 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-15 22:25:30,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:30,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:30,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:30,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 127 [2019-11-15 22:25:30,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:30,527 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-15 22:25:30,587 INFO L567 ElimStorePlain]: treesize reduction 72, result has 37.4 percent of original size [2019-11-15 22:25:30,587 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-15 22:25:30,587 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:195, output treesize:31 [2019-11-15 22:25:30,695 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-15 22:25:30,696 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:25:30,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 44 [2019-11-15 22:25:30,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854507916] [2019-11-15 22:25:30,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-15 22:25:30,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:30,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 22:25:30,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1776, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 22:25:30,697 INFO L87 Difference]: Start difference. First operand 251 states and 283 transitions. Second operand 45 states. [2019-11-15 22:25:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:37,019 INFO L93 Difference]: Finished difference Result 359 states and 397 transitions. [2019-11-15 22:25:37,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-11-15 22:25:37,019 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 48 [2019-11-15 22:25:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:37,021 INFO L225 Difference]: With dead ends: 359 [2019-11-15 22:25:37,021 INFO L226 Difference]: Without dead ends: 359 [2019-11-15 22:25:37,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2443 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1094, Invalid=6916, Unknown=0, NotChecked=0, Total=8010 [2019-11-15 22:25:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-15 22:25:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 250. [2019-11-15 22:25:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 22:25:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 281 transitions. [2019-11-15 22:25:37,025 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 281 transitions. Word has length 48 [2019-11-15 22:25:37,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:37,025 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 281 transitions. [2019-11-15 22:25:37,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-15 22:25:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 281 transitions. [2019-11-15 22:25:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:25:37,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:37,027 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] [2019-11-15 22:25:37,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:37,230 INFO L410 AbstractCegarLoop]: === Iteration 39 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:25:37,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:37,231 INFO L82 PathProgramCache]: Analyzing trace with hash 200688975, now seen corresponding path program 2 times [2019-11-15 22:25:37,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:37,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141907708] [2019-11-15 22:25:37,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:37,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:37,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:37,733 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-15 22:25:37,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141907708] [2019-11-15 22:25:37,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841513419] [2019-11-15 22:25:37,734 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:37,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:25:37,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:25:37,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 22:25:37,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:37,927 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-15 22:25:37,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:37,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:37,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:37,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 22:25:37,969 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:37,970 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-15 22:25:37,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:37,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:37,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:37,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 22:25:37,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:25:37,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:38,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-15 22:25:38,090 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:38,090 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-15 22:25:38,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,106 INFO L567 ElimStorePlain]: treesize reduction 24, result has 50.0 percent of original size [2019-11-15 22:25:38,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:24 [2019-11-15 22:25:38,141 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 22:25:38,142 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-15 22:25:38,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:38,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2019-11-15 22:25:38,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:38,162 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-15 22:25:38,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,183 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.2 percent of original size [2019-11-15 22:25:38,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2019-11-15 22:25:38,217 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-15 22:25:38,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:38,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:39 [2019-11-15 22:25:38,361 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:38,361 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-15 22:25:38,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:38,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:38,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:38,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:38,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:38,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:38,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:38,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:38,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:38,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:38,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:38,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:38,366 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:38,406 INFO L567 ElimStorePlain]: treesize reduction 52, result has 50.5 percent of original size [2019-11-15 22:25:38,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:38,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:58 [2019-11-15 22:25:38,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:38,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:38,505 INFO L341 Elim1Store]: treesize reduction 24, result has 63.6 percent of original size [2019-11-15 22:25:38,505 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 69 treesize of output 88 [2019-11-15 22:25:38,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:38,512 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-15 22:25:38,512 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,575 INFO L567 ElimStorePlain]: treesize reduction 63, result has 57.1 percent of original size [2019-11-15 22:25:38,575 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-15 22:25:38,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:135, output treesize:84 [2019-11-15 22:25:38,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:25:38,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:38,693 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 57 treesize of output 115 [2019-11-15 22:25:38,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,774 INFO L341 Elim1Store]: treesize reduction 12, result has 89.5 percent of original size [2019-11-15 22:25:38,774 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 61 treesize of output 149 [2019-11-15 22:25:38,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:38,868 INFO L567 ElimStorePlain]: treesize reduction 98, result has 56.3 percent of original size [2019-11-15 22:25:38,869 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-15 22:25:38,869 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:126 [2019-11-15 22:25:38,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,003 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:39,003 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 82 treesize of output 119 [2019-11-15 22:25:39,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:39,029 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:39,029 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 65 treesize of output 84 [2019-11-15 22:25:39,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:39,125 INFO L567 ElimStorePlain]: treesize reduction 108, result has 51.4 percent of original size [2019-11-15 22:25:39,126 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-15 22:25:39,126 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:148, output treesize:128 [2019-11-15 22:25:39,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,376 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:39,376 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 86 treesize of output 115 [2019-11-15 22:25:39,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,379 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:39,441 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:39,442 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 151 treesize of output 186 [2019-11-15 22:25:39,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,484 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-15 22:25:39,652 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2019-11-15 22:25:39,652 INFO L567 ElimStorePlain]: treesize reduction 168, result has 41.5 percent of original size [2019-11-15 22:25:39,653 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 2 xjuncts. [2019-11-15 22:25:39,653 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:238, output treesize:158 [2019-11-15 22:25:39,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:39,842 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:39,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 199 treesize of output 270 [2019-11-15 22:25:39,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:39,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:39,899 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:39,899 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 122 treesize of output 177 [2019-11-15 22:25:39,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:39,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:39,910 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-15 22:25:40,065 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 52 [2019-11-15 22:25:40,065 INFO L567 ElimStorePlain]: treesize reduction 1071, result has 17.4 percent of original size [2019-11-15 22:25:40,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-15 22:25:40,066 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:322, output treesize:224 [2019-11-15 22:25:40,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,444 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 97 treesize of output 85 [2019-11-15 22:25:40,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:40,448 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 162 treesize of output 150 [2019-11-15 22:25:40,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:40,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:40,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-15 22:25:40,486 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:260, output treesize:230 [2019-11-15 22:25:40,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,672 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:40,672 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 128 [2019-11-15 22:25:40,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,693 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:25:40,729 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:40,729 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 86 treesize of output 76 [2019-11-15 22:25:40,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:40,734 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-15 22:25:40,839 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 40 [2019-11-15 22:25:40,839 INFO L567 ElimStorePlain]: treesize reduction 100, result has 43.8 percent of original size [2019-11-15 22:25:40,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-11-15 22:25:40,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:238, output treesize:78 [2019-11-15 22:25:41,020 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-15 22:25:41,020 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:25:41,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 47 [2019-11-15 22:25:41,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296560465] [2019-11-15 22:25:41,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-15 22:25:41,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:41,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-15 22:25:41,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2015, Unknown=5, NotChecked=0, Total=2256 [2019-11-15 22:25:41,023 INFO L87 Difference]: Start difference. First operand 250 states and 281 transitions. Second operand 48 states. [2019-11-15 22:25:42,414 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-11-15 22:25:42,909 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-11-15 22:25:43,120 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-11-15 22:25:43,643 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-11-15 22:25:45,527 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 72 [2019-11-15 22:25:46,202 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 62 [2019-11-15 22:25:47,158 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-11-15 22:25:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:48,192 INFO L93 Difference]: Finished difference Result 427 states and 472 transitions. [2019-11-15 22:25:48,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-11-15 22:25:48,193 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-11-15 22:25:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:48,194 INFO L225 Difference]: With dead ends: 427 [2019-11-15 22:25:48,194 INFO L226 Difference]: Without dead ends: 427 [2019-11-15 22:25:48,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3588 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1709, Invalid=9206, Unknown=5, NotChecked=0, Total=10920 [2019-11-15 22:25:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-11-15 22:25:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 272. [2019-11-15 22:25:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-15 22:25:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 307 transitions. [2019-11-15 22:25:48,199 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 307 transitions. Word has length 48 [2019-11-15 22:25:48,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:48,199 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 307 transitions. [2019-11-15 22:25:48,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-11-15 22:25:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 307 transitions. [2019-11-15 22:25:48,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:25:48,200 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:48,200 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] [2019-11-15 22:25:48,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:48,404 INFO L410 AbstractCegarLoop]: === Iteration 40 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:25:48,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:48,404 INFO L82 PathProgramCache]: Analyzing trace with hash 200688976, now seen corresponding path program 2 times [2019-11-15 22:25:48,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:48,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405192264] [2019-11-15 22:25:48,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:48,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:48,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:49,312 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-15 22:25:49,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405192264] [2019-11-15 22:25:49,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706322892] [2019-11-15 22:25:49,313 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:49,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:25:49,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:25:49,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-15 22:25:49,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:25:49,548 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-15 22:25:49,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:49,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:49,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:49,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 22:25:49,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:49,611 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-15 22:25:49,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:49,635 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-15 22:25:49,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:49,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-15 22:25:49,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:25:49,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:49,700 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-11-15 22:25:49,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:25:49,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:49,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:49,716 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-15 22:25:49,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:36 [2019-11-15 22:25:49,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:49,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:25:49,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:49,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:49,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:49,866 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-15 22:25:49,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:49,901 INFO L567 ElimStorePlain]: treesize reduction 24, result has 65.7 percent of original size [2019-11-15 22:25:49,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:49,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:46 [2019-11-15 22:25:49,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:49,952 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-15 22:25:49,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:49,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:49,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:49,980 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-15 22:25:49,981 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:49,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:49,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:49,999 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 22:25:50,047 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_60|], 6=[|v_#valid_108|]} [2019-11-15 22:25:50,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:50,051 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-15 22:25:50,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:50,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:50,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:50,100 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-15 22:25:50,101 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:50,154 INFO L567 ElimStorePlain]: treesize reduction 28, result has 71.7 percent of original size [2019-11-15 22:25:50,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:25:50,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:71 [2019-11-15 22:25:50,212 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-15 22:25:50,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:50,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:50,242 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-15 22:25:50,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:50,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:50,264 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-15 22:25:50,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:73 [2019-11-15 22:25:50,416 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_114|], 6=[|v_#memory_$Pointer$.base_152|]} [2019-11-15 22:25:50,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:50,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:25:50,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:50,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:50,485 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:50,485 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-15 22:25:50,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:50,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:50,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:50,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:50,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:50,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:50,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:50,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:50,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:50,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:50,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:50,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:50,490 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-15 22:25:50,554 INFO L567 ElimStorePlain]: treesize reduction 60, result has 56.5 percent of original size [2019-11-15 22:25:50,554 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-15 22:25:50,554 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:131, output treesize:91 [2019-11-15 22:25:50,615 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_115|], 12=[|v_#memory_$Pointer$.base_153|]} [2019-11-15 22:25:50,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:50,620 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-15 22:25:50,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:50,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:50,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:50,701 INFO L341 Elim1Store]: treesize reduction 24, result has 63.6 percent of original size [2019-11-15 22:25:50,701 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-15 22:25:50,702 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:50,756 INFO L567 ElimStorePlain]: treesize reduction 50, result has 64.5 percent of original size [2019-11-15 22:25:50,756 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-15 22:25:50,757 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:129, output treesize:91 [2019-11-15 22:25:50,762 INFO L392 ElimStorePlain]: Different costs {3=[|v_#length_61|], 6=[|v_#valid_109|]} [2019-11-15 22:25:50,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:50,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:50,772 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-15 22:25:50,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:50,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:50,823 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:50,823 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-15 22:25:50,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:50,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:50,852 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-15 22:25:50,853 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:93 [2019-11-15 22:25:50,925 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_116|], 12=[|v_#memory_$Pointer$.base_154|]} [2019-11-15 22:25:50,929 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-15 22:25:50,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:50,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:50,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:50,998 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-15 22:25:50,999 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:51,070 INFO L567 ElimStorePlain]: treesize reduction 72, result has 56.4 percent of original size [2019-11-15 22:25:51,070 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-15 22:25:51,070 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:115, output treesize:95 [2019-11-15 22:25:51,235 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_117|], 12=[|v_#memory_$Pointer$.base_155|]} [2019-11-15 22:25:51,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:51,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:25:51,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:51,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:51,332 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:51,332 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-15 22:25:51,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:51,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:51,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:51,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:51,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:51,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:25:51,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,345 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-15 22:25:51,424 INFO L567 ElimStorePlain]: treesize reduction 112, result has 47.2 percent of original size [2019-11-15 22:25:51,424 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-15 22:25:51,425 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:185, output treesize:129 [2019-11-15 22:25:51,491 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_118|], 20=[|v_#memory_$Pointer$.base_156|]} [2019-11-15 22:25:51,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:25:51,496 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-15 22:25:51,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:51,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:51,681 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-11-15 22:25:51,681 INFO L341 Elim1Store]: treesize reduction 62, result has 72.9 percent of original size [2019-11-15 22:25:51,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 231 treesize of output 242 [2019-11-15 22:25:51,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,684 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:51,754 INFO L567 ElimStorePlain]: treesize reduction 232, result has 44.5 percent of original size [2019-11-15 22:25:51,754 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-15 22:25:51,754 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:296, output treesize:186 [2019-11-15 22:25:51,914 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2019-11-15 22:25:51,918 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-15 22:25:51,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:25:51,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:51,978 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:25:51,978 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 129 [2019-11-15 22:25:51,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:25:51,986 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-15 22:25:52,038 INFO L567 ElimStorePlain]: treesize reduction 72, result has 40.0 percent of original size [2019-11-15 22:25:52,039 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-15 22:25:52,039 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:200, output treesize:31 [2019-11-15 22:25:52,163 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-15 22:25:52,163 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:25:52,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 46 [2019-11-15 22:25:52,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617208640] [2019-11-15 22:25:52,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-15 22:25:52,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:25:52,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-15 22:25:52,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1945, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 22:25:52,165 INFO L87 Difference]: Start difference. First operand 272 states and 307 transitions. Second operand 47 states. [2019-11-15 22:25:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:25:58,706 INFO L93 Difference]: Finished difference Result 412 states and 457 transitions. [2019-11-15 22:25:58,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-11-15 22:25:58,706 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 48 [2019-11-15 22:25:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:25:58,708 INFO L225 Difference]: With dead ends: 412 [2019-11-15 22:25:58,708 INFO L226 Difference]: Without dead ends: 412 [2019-11-15 22:25:58,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3205 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1377, Invalid=8523, Unknown=0, NotChecked=0, Total=9900 [2019-11-15 22:25:58,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-15 22:25:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 259. [2019-11-15 22:25:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-15 22:25:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 292 transitions. [2019-11-15 22:25:58,718 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 292 transitions. Word has length 48 [2019-11-15 22:25:58,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:25:58,719 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 292 transitions. [2019-11-15 22:25:58,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-15 22:25:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 292 transitions. [2019-11-15 22:25:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:25:58,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:25:58,720 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] [2019-11-15 22:25:58,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:25:58,924 INFO L410 AbstractCegarLoop]: === Iteration 41 === [mainErr30REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr21REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION]=== [2019-11-15 22:25:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:25:58,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1911035799, now seen corresponding path program 1 times [2019-11-15 22:25:58,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:25:58,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318811680] [2019-11-15 22:25:58,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:58,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:25:58,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:25:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:25:58,944 ERROR L253 erpolLogProxyWrapper]: Interpolant 9 not inductive [2019-11-15 22:25:58,953 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-15 22:25:58,958 INFO L168 Benchmark]: Toolchain (without parser) took 145160.54 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 615.0 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -245.4 MB). Peak memory consumption was 369.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:58,958 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:25:58,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 557.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:58,958 INFO L168 Benchmark]: Boogie Preprocessor took 59.73 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:58,959 INFO L168 Benchmark]: RCFGBuilder took 823.83 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: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:58,959 INFO L168 Benchmark]: TraceAbstraction took 143713.30 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 475.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -137.5 MB). Peak memory consumption was 338.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:25:58,960 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.22 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 557.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.73 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 823.83 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: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 143713.30 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 475.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -137.5 MB). Peak memory consumption was 338.0 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-15 22:26:01,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:26:01,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:26:01,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:26:01,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:26:01,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:26:01,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:26:01,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:26:01,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:26:01,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:26:01,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:26:01,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:26:01,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:26:01,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:26:01,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:26:01,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:26:01,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:26:01,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:26:01,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:26:01,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:26:01,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:26:01,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:26:01,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:26:01,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:26:01,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:26:01,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:26:01,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:26:01,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:26:01,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:26:01,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:26:01,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:26:01,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:26:01,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:26:01,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:26:01,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:26:01,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:26:01,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:26:01,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:26:01,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:26:01,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:26:01,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:26:01,110 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 22:26:01,124 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:26:01,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:26:01,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:26:01,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:26:01,126 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:26:01,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:26:01,126 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:26:01,126 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:26:01,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:26:01,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:26:01,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:26:01,127 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:26:01,127 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:26:01,128 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:26:01,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:26:01,128 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:26:01,128 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:26:01,129 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:26:01,129 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:26:01,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:26:01,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:26:01,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:26:01,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:26:01,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:26:01,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:26:01,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:26:01,131 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:26:01,131 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:26:01,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:26:01,131 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_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/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 -> c7acae308721d0f16fed709193be74827b826330 [2019-11-15 22:26:01,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:26:01,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:26:01,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:26:01,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:26:01,178 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:26:01,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2019-11-15 22:26:01,237 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/data/45fa5a881/32a3529e97974998ab094ed4430eaf9c/FLAG033774cc1 [2019-11-15 22:26:01,723 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:26:01,727 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2019-11-15 22:26:01,751 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/data/45fa5a881/32a3529e97974998ab094ed4430eaf9c/FLAG033774cc1 [2019-11-15 22:26:02,056 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/data/45fa5a881/32a3529e97974998ab094ed4430eaf9c [2019-11-15 22:26:02,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:26:02,059 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:26:02,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:26:02,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:26:02,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:26:02,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:26:02" (1/1) ... [2019-11-15 22:26:02,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe0f7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:02, skipping insertion in model container [2019-11-15 22:26:02,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:26:02" (1/1) ... [2019-11-15 22:26:02,073 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:26:02,125 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:26:02,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:26:02,544 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:26:02,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:26:02,642 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:26:02,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:02 WrapperNode [2019-11-15 22:26:02,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:26:02,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:26:02,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:26:02,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:26:02,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:02" (1/1) ... [2019-11-15 22:26:02,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:02" (1/1) ... [2019-11-15 22:26:02,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:02" (1/1) ... [2019-11-15 22:26:02,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:02" (1/1) ... [2019-11-15 22:26:02,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:02" (1/1) ... [2019-11-15 22:26:02,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:02" (1/1) ... [2019-11-15 22:26:02,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:02" (1/1) ... [2019-11-15 22:26:02,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:26:02,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:26:02,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:26:02,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:26:02,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:26:02,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:26:02,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:26:02,764 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:26:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:26:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:26:02,764 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:26:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:26:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:26:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:26:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:26:02,765 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:26:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:26:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:26:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:26:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:26:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:26:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:26:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:26:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:26:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:26:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:26:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:26:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:26:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:26:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:26:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:26:02,768 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:26:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:26:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:26:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:26:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:26:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:26:02,769 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:26:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:26:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:26:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:26:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:26:02,770 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:26:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:26:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:26:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:26:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:26:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:26:02,771 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:26:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:26:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:26:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:26:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:26:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:26:02,772 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:26:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:26:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:26:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:26:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:26:02,773 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:26:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:26:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:26:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 22:26:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:26:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:26:02,774 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:26:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:26:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:26:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:26:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:26:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:26:02,775 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:26:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:26:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:26:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:26:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:26:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:26:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:26:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:26:02,778 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:26:02,778 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:26:02,778 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:26:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:26:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:26:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:26:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:26:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:26:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:26:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:26:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:26:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:26:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:26:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:26:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:26:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:26:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:26:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:26:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:26:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:26:02,782 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:26:02,783 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:26:02,783 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:26:02,783 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:26:02,783 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:26:02,783 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:26:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:26:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:26:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:26:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:26:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:26:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:26:02,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 22:26:02,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:26:02,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:26:02,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:26:02,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:26:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:26:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:26:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:26:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:26:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:26:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:26:03,632 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:26:03,633 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 22:26:03,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:26:03 BoogieIcfgContainer [2019-11-15 22:26:03,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:26:03,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:26:03,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:26:03,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:26:03,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:26:02" (1/3) ... [2019-11-15 22:26:03,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12035c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:26:03, skipping insertion in model container [2019-11-15 22:26:03,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:02" (2/3) ... [2019-11-15 22:26:03,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12035c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:26:03, skipping insertion in model container [2019-11-15 22:26:03,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:26:03" (3/3) ... [2019-11-15 22:26:03,641 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2019-11-15 22:26:03,649 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:26:03,656 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 50 error locations. [2019-11-15 22:26:03,666 INFO L249 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2019-11-15 22:26:03,683 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:26:03,683 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:26:03,683 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:26:03,684 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:26:03,684 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:26:03,684 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:26:03,684 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:26:03,685 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:26:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2019-11-15 22:26:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 22:26:03,709 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:03,710 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:03,712 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr29REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr44REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr37ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr36ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr49ENSURES_VIOLATIONMEMORY_LEAK, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-15 22:26:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:03,717 INFO L82 PathProgramCache]: Analyzing trace with hash 34969974, now seen corresponding path program 1 times [2019-11-15 22:26:03,726 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:26:03,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1292892141] [2019-11-15 22:26:03,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36efcb1e-4c1c-4ee2-95e3-64bd4a96dfcc/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-15 22:26:03,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:26:03,963 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-15 22:26:03,967 INFO L168 Benchmark]: Toolchain (without parser) took 1907.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 948.3 MB in the beginning and 1.0 GB in the end (delta: -91.9 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:03,969 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:26:03,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:03,970 INFO L168 Benchmark]: Boogie Preprocessor took 63.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:26:03,971 INFO L168 Benchmark]: RCFGBuilder took 926.76 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: 64.6 MB). Peak memory consumption was 64.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:03,972 INFO L168 Benchmark]: TraceAbstraction took 330.06 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:03,975 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 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 583.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 926.76 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: 64.6 MB). Peak memory consumption was 64.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 330.06 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: 13.2 MB). Peak memory consumption was 13.2 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...