./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.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_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/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 63ea7ed840682b4e196bd141458679e7836ad115 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/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 63ea7ed840682b4e196bd141458679e7836ad115 .............................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:23:10,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:23:10,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:23:10,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:23:10,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:23:10,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:23:10,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:23:10,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:23:10,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:23:10,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:23:10,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:23:10,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:23:10,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:23:10,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:23:10,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:23:10,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:23:10,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:23:10,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:23:10,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:23:10,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:23:10,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:23:10,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:23:10,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:23:10,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:23:10,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:23:10,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:23:10,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:23:10,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:23:10,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:23:10,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:23:10,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:23:10,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:23:10,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:23:10,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:23:10,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:23:10,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:23:10,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:23:10,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:23:10,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:23:10,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:23:10,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:23:10,773 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:23:10,798 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:23:10,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:23:10,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:23:10,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:23:10,800 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:23:10,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:23:10,800 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:23:10,800 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:23:10,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:23:10,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:23:10,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:23:10,801 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:23:10,801 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:23:10,802 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:23:10,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:23:10,802 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:23:10,802 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:23:10,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:23:10,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:23:10,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:23:10,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:23:10,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:23:10,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:23:10,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:23:10,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:23:10,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:23:10,804 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_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/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 -> 63ea7ed840682b4e196bd141458679e7836ad115 [2019-11-16 00:23:10,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:23:10,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:23:10,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:23:10,862 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:23:10,862 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:23:10,863 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/../../sv-benchmarks/c/heap-manipulation/dancing.i [2019-11-16 00:23:10,921 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/data/429f2c2c3/703e7d51d8d941afbd5cdbd01de08b0f/FLAG8389270b5 [2019-11-16 00:23:11,369 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:23:11,370 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/sv-benchmarks/c/heap-manipulation/dancing.i [2019-11-16 00:23:11,388 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/data/429f2c2c3/703e7d51d8d941afbd5cdbd01de08b0f/FLAG8389270b5 [2019-11-16 00:23:11,673 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/data/429f2c2c3/703e7d51d8d941afbd5cdbd01de08b0f [2019-11-16 00:23:11,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:23:11,678 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:23:11,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:23:11,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:23:11,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:23:11,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:23:11" (1/1) ... [2019-11-16 00:23:11,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f95461d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:11, skipping insertion in model container [2019-11-16 00:23:11,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:23:11" (1/1) ... [2019-11-16 00:23:11,706 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:23:11,765 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:23:12,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:23:12,199 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:23:12,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:23:12,327 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:23:12,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:12 WrapperNode [2019-11-16 00:23:12,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:23:12,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:23:12,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:23:12,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:23:12,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:12" (1/1) ... [2019-11-16 00:23:12,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:12" (1/1) ... [2019-11-16 00:23:12,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:12" (1/1) ... [2019-11-16 00:23:12,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:12" (1/1) ... [2019-11-16 00:23:12,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:12" (1/1) ... [2019-11-16 00:23:12,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:12" (1/1) ... [2019-11-16 00:23:12,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:12" (1/1) ... [2019-11-16 00:23:12,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:23:12,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:23:12,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:23:12,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:23:12,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:23:12,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:23:12,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:23:12,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-16 00:23:12,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:23:12,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:23:12,462 INFO L138 BoogieDeclarations]: Found implementation of procedure remove [2019-11-16 00:23:12,462 INFO L138 BoogieDeclarations]: Found implementation of procedure re_insert [2019-11-16 00:23:12,462 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2019-11-16 00:23:12,462 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:23:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-16 00:23:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-16 00:23:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:23:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-16 00:23:12,463 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:23:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:23:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:23:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:23:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:23:12,464 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:23:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:23:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:23:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:23:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:23:12,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:23:12,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:23:12,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:23:12,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:23:12,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:23:12,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:23:12,467 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:23:12,467 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:23:12,467 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:23:12,467 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:23:12,467 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:23:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:23:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:23:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:23:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:23:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:23:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:23:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:23:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:23:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:23:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:23:12,469 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:23:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:23:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:23:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:23:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:23:12,470 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:23:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:23:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:23:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:23:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:23:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:23:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:23:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:23:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:23:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:23:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:23:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:23:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:23:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:23:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:23:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:23:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:23:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:23:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:23:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:23:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:23:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:23:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:23:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:23:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:23:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:23:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:23:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:23:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:23:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:23:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:23:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:23:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:23:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:23:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:23:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:23:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:23:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:23:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:23:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:23:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:23:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:23:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:23:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:23:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:23:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:23:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:23:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:23:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:23:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:23:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:23:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:23:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:23:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:23:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:23:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:23:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:23:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:23:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:23:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:23:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:23:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:23:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:23:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:23:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:23:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:23:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2019-11-16 00:23:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:23:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:23:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure re_insert [2019-11-16 00:23:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2019-11-16 00:23:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:23:12,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:23:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:23:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:23:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:23:12,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:23:13,172 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:23:13,173 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-16 00:23:13,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:13 BoogieIcfgContainer [2019-11-16 00:23:13,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:23:13,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:23:13,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:23:13,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:23:13,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:23:11" (1/3) ... [2019-11-16 00:23:13,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b85a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:23:13, skipping insertion in model container [2019-11-16 00:23:13,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:23:12" (2/3) ... [2019-11-16 00:23:13,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b85a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:23:13, skipping insertion in model container [2019-11-16 00:23:13,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:13" (3/3) ... [2019-11-16 00:23:13,182 INFO L109 eAbstractionObserver]: Analyzing ICFG dancing.i [2019-11-16 00:23:13,190 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:23:13,197 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2019-11-16 00:23:13,207 INFO L249 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2019-11-16 00:23:13,224 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:23:13,224 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:23:13,224 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:23:13,225 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:23:13,225 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:23:13,225 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:23:13,225 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:23:13,225 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:23:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-11-16 00:23:13,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:23:13,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:13,251 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:13,252 INFO L410 AbstractCegarLoop]: === Iteration 1 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1095562270, now seen corresponding path program 1 times [2019-11-16 00:23:13,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:13,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195308440] [2019-11-16 00:23:13,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:13,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:13,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:13,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195308440] [2019-11-16 00:23:13,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:13,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:13,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289839413] [2019-11-16 00:23:13,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:13,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:13,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:13,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:13,457 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 4 states. [2019-11-16 00:23:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:13,841 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2019-11-16 00:23:13,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:13,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-16 00:23:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:13,853 INFO L225 Difference]: With dead ends: 115 [2019-11-16 00:23:13,853 INFO L226 Difference]: Without dead ends: 111 [2019-11-16 00:23:13,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-16 00:23:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-16 00:23:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-16 00:23:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2019-11-16 00:23:13,913 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 7 [2019-11-16 00:23:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:13,914 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2019-11-16 00:23:13,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2019-11-16 00:23:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:23:13,915 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:13,916 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:13,916 INFO L410 AbstractCegarLoop]: === Iteration 2 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:13,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1095562271, now seen corresponding path program 1 times [2019-11-16 00:23:13,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:13,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312324340] [2019-11-16 00:23:13,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:13,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:13,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:13,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312324340] [2019-11-16 00:23:13,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:13,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:13,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076282983] [2019-11-16 00:23:14,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:14,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:14,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:14,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:14,001 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 4 states. [2019-11-16 00:23:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:14,292 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-11-16 00:23:14,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:14,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-16 00:23:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:14,294 INFO L225 Difference]: With dead ends: 109 [2019-11-16 00:23:14,294 INFO L226 Difference]: Without dead ends: 109 [2019-11-16 00:23:14,295 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-16 00:23:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-16 00:23:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-16 00:23:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2019-11-16 00:23:14,306 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 7 [2019-11-16 00:23:14,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:14,307 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2019-11-16 00:23:14,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2019-11-16 00:23:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:23:14,308 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:14,308 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:14,309 INFO L410 AbstractCegarLoop]: === Iteration 3 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:14,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1109717268, now seen corresponding path program 1 times [2019-11-16 00:23:14,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:14,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034600858] [2019-11-16 00:23:14,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:14,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:14,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:14,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034600858] [2019-11-16 00:23:14,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:14,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:14,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885483268] [2019-11-16 00:23:14,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:14,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:14,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:14,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:14,416 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 4 states. [2019-11-16 00:23:14,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:14,818 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2019-11-16 00:23:14,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:14,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:23:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:14,820 INFO L225 Difference]: With dead ends: 121 [2019-11-16 00:23:14,820 INFO L226 Difference]: Without dead ends: 121 [2019-11-16 00:23:14,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:14,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-16 00:23:14,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2019-11-16 00:23:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-16 00:23:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2019-11-16 00:23:14,836 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 12 [2019-11-16 00:23:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:14,836 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2019-11-16 00:23:14,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2019-11-16 00:23:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:23:14,837 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:14,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:14,837 INFO L410 AbstractCegarLoop]: === Iteration 4 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:14,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:14,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1109717269, now seen corresponding path program 1 times [2019-11-16 00:23:14,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:14,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174028588] [2019-11-16 00:23:14,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:14,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:14,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:14,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174028588] [2019-11-16 00:23:14,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:14,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:23:14,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442660428] [2019-11-16 00:23:14,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:14,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:14,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:14,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:14,943 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 4 states. [2019-11-16 00:23:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:15,289 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2019-11-16 00:23:15,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:15,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:23:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:15,291 INFO L225 Difference]: With dead ends: 121 [2019-11-16 00:23:15,291 INFO L226 Difference]: Without dead ends: 121 [2019-11-16 00:23:15,291 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-16 00:23:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-16 00:23:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2019-11-16 00:23:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-16 00:23:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2019-11-16 00:23:15,302 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 12 [2019-11-16 00:23:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:15,302 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2019-11-16 00:23:15,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2019-11-16 00:23:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:23:15,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:15,303 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:15,304 INFO L410 AbstractCegarLoop]: === Iteration 5 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:15,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1287036711, now seen corresponding path program 1 times [2019-11-16 00:23:15,304 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:15,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244745838] [2019-11-16 00:23:15,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:15,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:15,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:15,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244745838] [2019-11-16 00:23:15,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:15,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:15,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855084052] [2019-11-16 00:23:15,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:15,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:15,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:15,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:15,383 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 6 states. [2019-11-16 00:23:15,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:15,859 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2019-11-16 00:23:15,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:23:15,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-16 00:23:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:15,863 INFO L225 Difference]: With dead ends: 132 [2019-11-16 00:23:15,863 INFO L226 Difference]: Without dead ends: 132 [2019-11-16 00:23:15,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:23:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-16 00:23:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2019-11-16 00:23:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-16 00:23:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 150 transitions. [2019-11-16 00:23:15,885 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 150 transitions. Word has length 14 [2019-11-16 00:23:15,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:15,886 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 150 transitions. [2019-11-16 00:23:15,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:15,886 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 150 transitions. [2019-11-16 00:23:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:23:15,887 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:15,887 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:15,888 INFO L410 AbstractCegarLoop]: === Iteration 6 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:15,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:15,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1286407096, now seen corresponding path program 1 times [2019-11-16 00:23:15,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:15,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493484627] [2019-11-16 00:23:15,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:15,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:15,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:16,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493484627] [2019-11-16 00:23:16,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:16,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:23:16,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074408742] [2019-11-16 00:23:16,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:23:16,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:16,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:23:16,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:16,028 INFO L87 Difference]: Start difference. First operand 126 states and 150 transitions. Second operand 6 states. [2019-11-16 00:23:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:16,411 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2019-11-16 00:23:16,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:23:16,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-16 00:23:16,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:16,412 INFO L225 Difference]: With dead ends: 125 [2019-11-16 00:23:16,412 INFO L226 Difference]: Without dead ends: 125 [2019-11-16 00:23:16,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-16 00:23:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-11-16 00:23:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-16 00:23:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2019-11-16 00:23:16,421 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 14 [2019-11-16 00:23:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:16,421 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2019-11-16 00:23:16,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:23:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2019-11-16 00:23:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:23:16,422 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:16,422 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:16,422 INFO L410 AbstractCegarLoop]: === Iteration 7 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:16,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1286407095, now seen corresponding path program 1 times [2019-11-16 00:23:16,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:16,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7746156] [2019-11-16 00:23:16,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:16,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:16,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:16,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7746156] [2019-11-16 00:23:16,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:16,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:16,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891814337] [2019-11-16 00:23:16,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:16,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:16,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:16,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:16,491 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand 7 states. [2019-11-16 00:23:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:16,814 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2019-11-16 00:23:16,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:23:16,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-16 00:23:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:16,815 INFO L225 Difference]: With dead ends: 124 [2019-11-16 00:23:16,815 INFO L226 Difference]: Without dead ends: 124 [2019-11-16 00:23:16,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:23:16,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-16 00:23:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-11-16 00:23:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-16 00:23:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2019-11-16 00:23:16,823 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 14 [2019-11-16 00:23:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:16,824 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2019-11-16 00:23:16,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2019-11-16 00:23:16,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:23:16,825 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:16,825 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:16,825 INFO L410 AbstractCegarLoop]: === Iteration 8 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:16,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:16,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1312287967, now seen corresponding path program 1 times [2019-11-16 00:23:16,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:16,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170679276] [2019-11-16 00:23:16,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:16,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:16,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:16,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170679276] [2019-11-16 00:23:16,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:16,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:23:16,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976724944] [2019-11-16 00:23:16,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:23:16,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:16,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:23:16,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:23:16,900 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand 8 states. [2019-11-16 00:23:17,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:17,414 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2019-11-16 00:23:17,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:17,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-16 00:23:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:17,416 INFO L225 Difference]: With dead ends: 146 [2019-11-16 00:23:17,417 INFO L226 Difference]: Without dead ends: 146 [2019-11-16 00:23:17,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:23:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-16 00:23:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2019-11-16 00:23:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-16 00:23:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 167 transitions. [2019-11-16 00:23:17,424 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 167 transitions. Word has length 19 [2019-11-16 00:23:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:17,424 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 167 transitions. [2019-11-16 00:23:17,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:23:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 167 transitions. [2019-11-16 00:23:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-16 00:23:17,425 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:17,425 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:17,425 INFO L410 AbstractCegarLoop]: === Iteration 9 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:17,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:17,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1312287966, now seen corresponding path program 1 times [2019-11-16 00:23:17,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:17,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327054908] [2019-11-16 00:23:17,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:17,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:17,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:17,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327054908] [2019-11-16 00:23:17,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:17,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:23:17,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196987212] [2019-11-16 00:23:17,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:23:17,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:17,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:23:17,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:23:17,515 INFO L87 Difference]: Start difference. First operand 134 states and 167 transitions. Second operand 8 states. [2019-11-16 00:23:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:18,041 INFO L93 Difference]: Finished difference Result 142 states and 165 transitions. [2019-11-16 00:23:18,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:18,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-16 00:23:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:18,043 INFO L225 Difference]: With dead ends: 142 [2019-11-16 00:23:18,043 INFO L226 Difference]: Without dead ends: 142 [2019-11-16 00:23:18,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:23:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-16 00:23:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2019-11-16 00:23:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-16 00:23:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 161 transitions. [2019-11-16 00:23:18,050 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 161 transitions. Word has length 19 [2019-11-16 00:23:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:18,050 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 161 transitions. [2019-11-16 00:23:18,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:23:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2019-11-16 00:23:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:23:18,051 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:18,051 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] [2019-11-16 00:23:18,051 INFO L410 AbstractCegarLoop]: === Iteration 10 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1391635834, now seen corresponding path program 1 times [2019-11-16 00:23:18,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:18,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960732496] [2019-11-16 00:23:18,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:18,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:18,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:18,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960732496] [2019-11-16 00:23:18,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500809084] [2019-11-16 00:23:18,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:18,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:23:18,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:18,263 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:18,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-16 00:23:18,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867872394] [2019-11-16 00:23:18,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:18,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:18,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:18,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:18,265 INFO L87 Difference]: Start difference. First operand 134 states and 161 transitions. Second operand 7 states. [2019-11-16 00:23:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:18,646 INFO L93 Difference]: Finished difference Result 146 states and 176 transitions. [2019-11-16 00:23:18,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:18,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-16 00:23:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:18,648 INFO L225 Difference]: With dead ends: 146 [2019-11-16 00:23:18,648 INFO L226 Difference]: Without dead ends: 146 [2019-11-16 00:23:18,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:23:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-16 00:23:18,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2019-11-16 00:23:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-16 00:23:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 173 transitions. [2019-11-16 00:23:18,655 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 173 transitions. Word has length 20 [2019-11-16 00:23:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:18,655 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 173 transitions. [2019-11-16 00:23:18,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 173 transitions. [2019-11-16 00:23:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:23:18,656 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:18,656 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] [2019-11-16 00:23:18,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:18,868 INFO L410 AbstractCegarLoop]: === Iteration 11 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:18,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:18,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1391635835, now seen corresponding path program 1 times [2019-11-16 00:23:18,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:18,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448360432] [2019-11-16 00:23:18,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:18,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:18,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:18,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448360432] [2019-11-16 00:23:18,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105590556] [2019-11-16 00:23:18,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:19,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-16 00:23:19,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:19,182 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:19,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2019-11-16 00:23:19,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708409385] [2019-11-16 00:23:19,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:23:19,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:19,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:23:19,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:23:19,183 INFO L87 Difference]: Start difference. First operand 142 states and 173 transitions. Second operand 13 states. [2019-11-16 00:23:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:19,658 INFO L93 Difference]: Finished difference Result 143 states and 173 transitions. [2019-11-16 00:23:19,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:19,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-11-16 00:23:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:19,660 INFO L225 Difference]: With dead ends: 143 [2019-11-16 00:23:19,660 INFO L226 Difference]: Without dead ends: 143 [2019-11-16 00:23:19,661 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:23:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-16 00:23:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-11-16 00:23:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-16 00:23:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 170 transitions. [2019-11-16 00:23:19,668 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 170 transitions. Word has length 20 [2019-11-16 00:23:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:19,668 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 170 transitions. [2019-11-16 00:23:19,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:23:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 170 transitions. [2019-11-16 00:23:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:23:19,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:19,670 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:19,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:19,874 INFO L410 AbstractCegarLoop]: === Iteration 12 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:19,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:19,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1685554971, now seen corresponding path program 1 times [2019-11-16 00:23:19,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:19,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952574251] [2019-11-16 00:23:19,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:19,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:19,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:20,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952574251] [2019-11-16 00:23:20,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:20,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:23:20,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054195227] [2019-11-16 00:23:20,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:23:20,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:20,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:23:20,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:23:20,126 INFO L87 Difference]: Start difference. First operand 141 states and 170 transitions. Second operand 10 states. [2019-11-16 00:23:20,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:20,710 INFO L93 Difference]: Finished difference Result 166 states and 204 transitions. [2019-11-16 00:23:20,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:23:20,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-16 00:23:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:20,713 INFO L225 Difference]: With dead ends: 166 [2019-11-16 00:23:20,713 INFO L226 Difference]: Without dead ends: 166 [2019-11-16 00:23:20,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:23:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-16 00:23:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2019-11-16 00:23:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-16 00:23:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 187 transitions. [2019-11-16 00:23:20,723 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 187 transitions. Word has length 23 [2019-11-16 00:23:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:20,725 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 187 transitions. [2019-11-16 00:23:20,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:23:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 187 transitions. [2019-11-16 00:23:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:23:20,726 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:20,726 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:20,727 INFO L410 AbstractCegarLoop]: === Iteration 13 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:20,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:20,727 INFO L82 PathProgramCache]: Analyzing trace with hash -259637529, now seen corresponding path program 1 times [2019-11-16 00:23:20,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:20,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678810904] [2019-11-16 00:23:20,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:20,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:20,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:20,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678810904] [2019-11-16 00:23:20,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:20,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:23:20,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134452860] [2019-11-16 00:23:20,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:23:20,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:20,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:23:20,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:23:20,886 INFO L87 Difference]: Start difference. First operand 153 states and 187 transitions. Second operand 9 states. [2019-11-16 00:23:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:21,347 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2019-11-16 00:23:21,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:21,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-16 00:23:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:21,350 INFO L225 Difference]: With dead ends: 161 [2019-11-16 00:23:21,350 INFO L226 Difference]: Without dead ends: 161 [2019-11-16 00:23:21,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:23:21,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-16 00:23:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2019-11-16 00:23:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-16 00:23:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 185 transitions. [2019-11-16 00:23:21,356 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 185 transitions. Word has length 25 [2019-11-16 00:23:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:21,357 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 185 transitions. [2019-11-16 00:23:21,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:23:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 185 transitions. [2019-11-16 00:23:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-16 00:23:21,358 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:21,358 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:21,358 INFO L410 AbstractCegarLoop]: === Iteration 14 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1568210770, now seen corresponding path program 1 times [2019-11-16 00:23:21,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:21,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780934502] [2019-11-16 00:23:21,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:21,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:21,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:21,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780934502] [2019-11-16 00:23:21,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774729904] [2019-11-16 00:23:21,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:21,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:23:21,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:21,672 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:21,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-16 00:23:21,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609298539] [2019-11-16 00:23:21,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:23:21,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:21,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:23:21,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:23:21,674 INFO L87 Difference]: Start difference. First operand 153 states and 185 transitions. Second operand 13 states. [2019-11-16 00:23:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:22,499 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2019-11-16 00:23:22,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:22,500 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-16 00:23:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:22,501 INFO L225 Difference]: With dead ends: 172 [2019-11-16 00:23:22,501 INFO L226 Difference]: Without dead ends: 170 [2019-11-16 00:23:22,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:23:22,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-16 00:23:22,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2019-11-16 00:23:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-16 00:23:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 184 transitions. [2019-11-16 00:23:22,508 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 184 transitions. Word has length 25 [2019-11-16 00:23:22,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:22,509 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 184 transitions. [2019-11-16 00:23:22,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:23:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 184 transitions. [2019-11-16 00:23:22,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:23:22,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:22,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] [2019-11-16 00:23:22,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:22,714 INFO L410 AbstractCegarLoop]: === Iteration 15 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:22,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2117203085, now seen corresponding path program 1 times [2019-11-16 00:23:22,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:22,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664093066] [2019-11-16 00:23:22,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:22,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:22,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:22,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664093066] [2019-11-16 00:23:22,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487980907] [2019-11-16 00:23:22,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:23,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-16 00:23:23,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:23:23,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:23,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:23,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:23,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-11-16 00:23:23,237 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 21 treesize of output 9 [2019-11-16 00:23:23,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:23,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:23,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:23,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-11-16 00:23:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:23,270 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:23,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2019-11-16 00:23:23,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974796012] [2019-11-16 00:23:23,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-16 00:23:23,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:23,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:23:23,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:23:23,271 INFO L87 Difference]: Start difference. First operand 153 states and 184 transitions. Second operand 21 states. [2019-11-16 00:23:24,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:24,866 INFO L93 Difference]: Finished difference Result 229 states and 286 transitions. [2019-11-16 00:23:24,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:23:24,867 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2019-11-16 00:23:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:24,869 INFO L225 Difference]: With dead ends: 229 [2019-11-16 00:23:24,869 INFO L226 Difference]: Without dead ends: 229 [2019-11-16 00:23:24,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2019-11-16 00:23:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-16 00:23:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 175. [2019-11-16 00:23:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-16 00:23:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 209 transitions. [2019-11-16 00:23:24,879 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 209 transitions. Word has length 26 [2019-11-16 00:23:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:24,879 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 209 transitions. [2019-11-16 00:23:24,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-16 00:23:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 209 transitions. [2019-11-16 00:23:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:23:24,881 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:24,881 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] [2019-11-16 00:23:25,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:25,089 INFO L410 AbstractCegarLoop]: === Iteration 16 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:25,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2117203084, now seen corresponding path program 1 times [2019-11-16 00:23:25,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:25,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465983661] [2019-11-16 00:23:25,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:25,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:25,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465983661] [2019-11-16 00:23:25,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326548670] [2019-11-16 00:23:25,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:25,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-16 00:23:25,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:25,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:23:25,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:25,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:25,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:23:25,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:25,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:25,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:25,518 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2019-11-16 00:23:25,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-16 00:23:25,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:25,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:25,664 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 37 treesize of output 13 [2019-11-16 00:23:25,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:25,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:25,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:25,671 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:13 [2019-11-16 00:23:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:25,740 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:25,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-16 00:23:25,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146326031] [2019-11-16 00:23:25,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-16 00:23:25,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:25,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:23:25,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:23:25,742 INFO L87 Difference]: Start difference. First operand 175 states and 209 transitions. Second operand 22 states. [2019-11-16 00:23:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:27,162 INFO L93 Difference]: Finished difference Result 221 states and 275 transitions. [2019-11-16 00:23:27,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:23:27,163 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-11-16 00:23:27,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:27,164 INFO L225 Difference]: With dead ends: 221 [2019-11-16 00:23:27,164 INFO L226 Difference]: Without dead ends: 221 [2019-11-16 00:23:27,165 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:23:27,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-16 00:23:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 191. [2019-11-16 00:23:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-16 00:23:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 228 transitions. [2019-11-16 00:23:27,179 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 228 transitions. Word has length 26 [2019-11-16 00:23:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:27,179 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 228 transitions. [2019-11-16 00:23:27,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-16 00:23:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 228 transitions. [2019-11-16 00:23:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:23:27,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:27,181 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:27,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:27,385 INFO L410 AbstractCegarLoop]: === Iteration 17 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:27,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:27,385 INFO L82 PathProgramCache]: Analyzing trace with hash -891622, now seen corresponding path program 1 times [2019-11-16 00:23:27,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:27,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508813026] [2019-11-16 00:23:27,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:27,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:27,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:27,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508813026] [2019-11-16 00:23:27,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:27,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:23:27,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230352426] [2019-11-16 00:23:27,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:23:27,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:27,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:23:27,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:23:27,451 INFO L87 Difference]: Start difference. First operand 191 states and 228 transitions. Second operand 7 states. [2019-11-16 00:23:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:27,966 INFO L93 Difference]: Finished difference Result 209 states and 251 transitions. [2019-11-16 00:23:27,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:27,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-16 00:23:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:27,968 INFO L225 Difference]: With dead ends: 209 [2019-11-16 00:23:27,968 INFO L226 Difference]: Without dead ends: 209 [2019-11-16 00:23:27,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:23:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-16 00:23:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 190. [2019-11-16 00:23:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-16 00:23:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 227 transitions. [2019-11-16 00:23:27,973 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 227 transitions. Word has length 27 [2019-11-16 00:23:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:27,974 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 227 transitions. [2019-11-16 00:23:27,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:23:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 227 transitions. [2019-11-16 00:23:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-16 00:23:27,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:27,975 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:27,975 INFO L410 AbstractCegarLoop]: === Iteration 18 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash -891621, now seen corresponding path program 1 times [2019-11-16 00:23:27,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:27,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068837930] [2019-11-16 00:23:27,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:27,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:27,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:23:28,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068837930] [2019-11-16 00:23:28,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:28,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:23:28,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845632348] [2019-11-16 00:23:28,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:23:28,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:28,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:23:28,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:23:28,059 INFO L87 Difference]: Start difference. First operand 190 states and 227 transitions. Second operand 5 states. [2019-11-16 00:23:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:28,249 INFO L93 Difference]: Finished difference Result 201 states and 240 transitions. [2019-11-16 00:23:28,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:23:28,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-16 00:23:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:28,251 INFO L225 Difference]: With dead ends: 201 [2019-11-16 00:23:28,251 INFO L226 Difference]: Without dead ends: 196 [2019-11-16 00:23:28,251 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:23:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-16 00:23:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2019-11-16 00:23:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-16 00:23:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 225 transitions. [2019-11-16 00:23:28,258 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 225 transitions. Word has length 27 [2019-11-16 00:23:28,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:28,259 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 225 transitions. [2019-11-16 00:23:28,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:23:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 225 transitions. [2019-11-16 00:23:28,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:23:28,260 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:28,260 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:28,260 INFO L410 AbstractCegarLoop]: === Iteration 19 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:28,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:28,261 INFO L82 PathProgramCache]: Analyzing trace with hash -998069132, now seen corresponding path program 1 times [2019-11-16 00:23:28,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:28,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121756733] [2019-11-16 00:23:28,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:28,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:28,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:28,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121756733] [2019-11-16 00:23:28,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013338017] [2019-11-16 00:23:28,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:29,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-16 00:23:29,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:29,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 13 treesize of output 9 [2019-11-16 00:23:29,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:29,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:29,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:29,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2019-11-16 00:23:29,289 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:29,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2019-11-16 00:23:29,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:29,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:29,294 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:29,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:29,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:29,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-16 00:23:29,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:24 [2019-11-16 00:23:29,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:29,372 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:29,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 24 [2019-11-16 00:23:29,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027778417] [2019-11-16 00:23:29,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-16 00:23:29,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:29,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-16 00:23:29,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:23:29,374 INFO L87 Difference]: Start difference. First operand 190 states and 225 transitions. Second operand 25 states. [2019-11-16 00:23:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:32,641 INFO L93 Difference]: Finished difference Result 342 states and 403 transitions. [2019-11-16 00:23:32,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-16 00:23:32,645 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2019-11-16 00:23:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:32,647 INFO L225 Difference]: With dead ends: 342 [2019-11-16 00:23:32,647 INFO L226 Difference]: Without dead ends: 342 [2019-11-16 00:23:32,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=279, Invalid=1613, Unknown=0, NotChecked=0, Total=1892 [2019-11-16 00:23:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-11-16 00:23:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 279. [2019-11-16 00:23:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-16 00:23:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 343 transitions. [2019-11-16 00:23:32,665 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 343 transitions. Word has length 29 [2019-11-16 00:23:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:32,666 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 343 transitions. [2019-11-16 00:23:32,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-16 00:23:32,666 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 343 transitions. [2019-11-16 00:23:32,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-16 00:23:32,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:32,668 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:32,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:32,872 INFO L410 AbstractCegarLoop]: === Iteration 20 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:32,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:32,872 INFO L82 PathProgramCache]: Analyzing trace with hash -998069131, now seen corresponding path program 1 times [2019-11-16 00:23:32,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:32,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54594320] [2019-11-16 00:23:32,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:32,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:32,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:33,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54594320] [2019-11-16 00:23:33,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646705537] [2019-11-16 00:23:33,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:33,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-16 00:23:33,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:33,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:23:33,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:33,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:33,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:23:33,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:33,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:33,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:33,842 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:38 [2019-11-16 00:23:34,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 29 treesize of output 17 [2019-11-16 00:23:34,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:34,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 41 treesize of output 17 [2019-11-16 00:23:34,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:34,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:23:34,075 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:14 [2019-11-16 00:23:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:34,113 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:34,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 24 [2019-11-16 00:23:34,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755593160] [2019-11-16 00:23:34,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-16 00:23:34,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:34,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-16 00:23:34,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:23:34,115 INFO L87 Difference]: Start difference. First operand 279 states and 343 transitions. Second operand 25 states. [2019-11-16 00:23:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:37,642 INFO L93 Difference]: Finished difference Result 373 states and 440 transitions. [2019-11-16 00:23:37,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-16 00:23:37,642 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 29 [2019-11-16 00:23:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:37,644 INFO L225 Difference]: With dead ends: 373 [2019-11-16 00:23:37,644 INFO L226 Difference]: Without dead ends: 373 [2019-11-16 00:23:37,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=276, Invalid=1616, Unknown=0, NotChecked=0, Total=1892 [2019-11-16 00:23:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-16 00:23:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 305. [2019-11-16 00:23:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-16 00:23:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 378 transitions. [2019-11-16 00:23:37,657 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 378 transitions. Word has length 29 [2019-11-16 00:23:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:37,657 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 378 transitions. [2019-11-16 00:23:37,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-16 00:23:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 378 transitions. [2019-11-16 00:23:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-16 00:23:37,658 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:37,658 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:37,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:37,861 INFO L410 AbstractCegarLoop]: === Iteration 21 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:23:37,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:37,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1010709834, now seen corresponding path program 1 times [2019-11-16 00:23:37,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:23:37,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943921097] [2019-11-16 00:23:37,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:37,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:23:37,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:23:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:38,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943921097] [2019-11-16 00:23:38,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802444920] [2019-11-16 00:23:38,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:23:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:38,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:23:38,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:38,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:38,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:23:38,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:23:38,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:38,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:23:38,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-11-16 00:23:40,641 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,642 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 20 treesize of output 20 [2019-11-16 00:23:40,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:23:40,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:23:40,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:23:40,652 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-16 00:23:40,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:18 [2019-11-16 00:23:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:23:40,713 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:23:40,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2019-11-16 00:23:40,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277070659] [2019-11-16 00:23:40,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-16 00:23:40,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:23:40,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-16 00:23:40,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=487, Unknown=1, NotChecked=0, Total=552 [2019-11-16 00:23:40,714 INFO L87 Difference]: Start difference. First operand 305 states and 378 transitions. Second operand 24 states. [2019-11-16 00:24:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:27,734 INFO L93 Difference]: Finished difference Result 337 states and 396 transitions. [2019-11-16 00:24:27,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-16 00:24:27,735 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2019-11-16 00:24:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:27,736 INFO L225 Difference]: With dead ends: 337 [2019-11-16 00:24:27,736 INFO L226 Difference]: Without dead ends: 336 [2019-11-16 00:24:27,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=220, Invalid=1336, Unknown=4, NotChecked=0, Total=1560 [2019-11-16 00:24:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-16 00:24:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 278. [2019-11-16 00:24:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-11-16 00:24:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 341 transitions. [2019-11-16 00:24:27,746 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 341 transitions. Word has length 31 [2019-11-16 00:24:27,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:27,746 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 341 transitions. [2019-11-16 00:24:27,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-16 00:24:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 341 transitions. [2019-11-16 00:24:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-16 00:24:27,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:27,748 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] [2019-11-16 00:24:27,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:27,951 INFO L410 AbstractCegarLoop]: === Iteration 22 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:24:27,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:27,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1673297915, now seen corresponding path program 1 times [2019-11-16 00:24:27,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:27,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111451587] [2019-11-16 00:24:27,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:27,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:27,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:28,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111451587] [2019-11-16 00:24:28,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151527052] [2019-11-16 00:24:28,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:28,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-16 00:24:28,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:28,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:24:28,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:28,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:28,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:24:28,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:28,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:28,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:28,797 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:44 [2019-11-16 00:24:28,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2019-11-16 00:24:28,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:28,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:28,921 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 41 treesize of output 17 [2019-11-16 00:24:28,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:28,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:28,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:28,932 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:20 [2019-11-16 00:24:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:29,074 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:29,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2019-11-16 00:24:29,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027877324] [2019-11-16 00:24:29,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-16 00:24:29,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:29,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-16 00:24:29,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:24:29,077 INFO L87 Difference]: Start difference. First operand 278 states and 341 transitions. Second operand 27 states. [2019-11-16 00:24:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:30,202 INFO L93 Difference]: Finished difference Result 291 states and 359 transitions. [2019-11-16 00:24:30,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:24:30,206 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-16 00:24:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:30,207 INFO L225 Difference]: With dead ends: 291 [2019-11-16 00:24:30,207 INFO L226 Difference]: Without dead ends: 291 [2019-11-16 00:24:30,208 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2019-11-16 00:24:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-16 00:24:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 278. [2019-11-16 00:24:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-11-16 00:24:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 340 transitions. [2019-11-16 00:24:30,216 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 340 transitions. Word has length 32 [2019-11-16 00:24:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:30,217 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 340 transitions. [2019-11-16 00:24:30,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-16 00:24:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 340 transitions. [2019-11-16 00:24:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:24:30,217 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:30,217 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:30,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:30,418 INFO L410 AbstractCegarLoop]: === Iteration 23 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:24:30,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:30,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1091667486, now seen corresponding path program 1 times [2019-11-16 00:24:30,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:30,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493257430] [2019-11-16 00:24:30,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:30,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:30,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:30,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493257430] [2019-11-16 00:24:30,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:30,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:24:30,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225217272] [2019-11-16 00:24:30,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:24:30,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:30,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:24:30,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:24:30,532 INFO L87 Difference]: Start difference. First operand 278 states and 340 transitions. Second operand 9 states. [2019-11-16 00:24:31,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:31,102 INFO L93 Difference]: Finished difference Result 330 states and 394 transitions. [2019-11-16 00:24:31,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:24:31,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-16 00:24:31,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:31,104 INFO L225 Difference]: With dead ends: 330 [2019-11-16 00:24:31,104 INFO L226 Difference]: Without dead ends: 330 [2019-11-16 00:24:31,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:24:31,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-16 00:24:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 300. [2019-11-16 00:24:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-16 00:24:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 374 transitions. [2019-11-16 00:24:31,113 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 374 transitions. Word has length 35 [2019-11-16 00:24:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:31,113 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 374 transitions. [2019-11-16 00:24:31,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:24:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 374 transitions. [2019-11-16 00:24:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:24:31,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:31,114 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:31,114 INFO L410 AbstractCegarLoop]: === Iteration 24 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:24:31,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:31,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1091667485, now seen corresponding path program 1 times [2019-11-16 00:24:31,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:31,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150834270] [2019-11-16 00:24:31,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:31,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:31,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:31,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150834270] [2019-11-16 00:24:31,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:31,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:24:31,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169332571] [2019-11-16 00:24:31,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:24:31,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:31,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:24:31,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:24:31,231 INFO L87 Difference]: Start difference. First operand 300 states and 374 transitions. Second operand 9 states. [2019-11-16 00:24:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:31,950 INFO L93 Difference]: Finished difference Result 326 states and 387 transitions. [2019-11-16 00:24:31,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:24:31,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-16 00:24:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:31,953 INFO L225 Difference]: With dead ends: 326 [2019-11-16 00:24:31,953 INFO L226 Difference]: Without dead ends: 326 [2019-11-16 00:24:31,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:24:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-16 00:24:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 300. [2019-11-16 00:24:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-16 00:24:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 367 transitions. [2019-11-16 00:24:31,963 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 367 transitions. Word has length 35 [2019-11-16 00:24:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:31,964 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 367 transitions. [2019-11-16 00:24:31,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:24:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 367 transitions. [2019-11-16 00:24:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:24:31,965 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:31,965 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] [2019-11-16 00:24:31,965 INFO L410 AbstractCegarLoop]: === Iteration 25 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:24:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1119855526, now seen corresponding path program 1 times [2019-11-16 00:24:31,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:31,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078987539] [2019-11-16 00:24:31,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:31,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:31,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:24:32,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078987539] [2019-11-16 00:24:32,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:32,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:24:32,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117163106] [2019-11-16 00:24:32,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:24:32,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:32,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:24:32,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:24:32,054 INFO L87 Difference]: Start difference. First operand 300 states and 367 transitions. Second operand 7 states. [2019-11-16 00:24:32,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:32,651 INFO L93 Difference]: Finished difference Result 312 states and 380 transitions. [2019-11-16 00:24:32,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:24:32,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-16 00:24:32,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:32,653 INFO L225 Difference]: With dead ends: 312 [2019-11-16 00:24:32,653 INFO L226 Difference]: Without dead ends: 312 [2019-11-16 00:24:32,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:24:32,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-16 00:24:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 294. [2019-11-16 00:24:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-16 00:24:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 358 transitions. [2019-11-16 00:24:32,663 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 358 transitions. Word has length 34 [2019-11-16 00:24:32,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:32,663 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 358 transitions. [2019-11-16 00:24:32,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:24:32,663 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 358 transitions. [2019-11-16 00:24:32,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:24:32,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:32,664 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:32,665 INFO L410 AbstractCegarLoop]: === Iteration 26 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:24:32,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:32,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1281727676, now seen corresponding path program 1 times [2019-11-16 00:24:32,666 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:32,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223813130] [2019-11-16 00:24:32,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:32,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:32,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:33,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223813130] [2019-11-16 00:24:33,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779114977] [2019-11-16 00:24:33,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:33,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-16 00:24:33,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:33,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:33,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:24:33,267 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-11-16 00:24:33,283 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:33,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-11-16 00:24:33,294 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,304 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,327 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 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-16 00:24:33,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2019-11-16 00:24:33,336 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,346 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,360 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:41 [2019-11-16 00:24:33,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,473 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 28 treesize of output 30 [2019-11-16 00:24:33,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,503 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 28 treesize of output 30 [2019-11-16 00:24:33,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,522 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:66 [2019-11-16 00:24:33,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2019-11-16 00:24:33,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2019-11-16 00:24:33,633 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,657 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:84 [2019-11-16 00:24:33,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,740 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 92 [2019-11-16 00:24:33,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,816 INFO L567 ElimStorePlain]: treesize reduction 22, result has 84.5 percent of original size [2019-11-16 00:24:33,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:33,841 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:33,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 121 [2019-11-16 00:24:33,842 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:33,911 INFO L567 ElimStorePlain]: treesize reduction 50, result has 71.9 percent of original size [2019-11-16 00:24:33,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:33,914 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:128 [2019-11-16 00:24:33,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:33,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:34,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:35,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:35,114 INFO L392 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.base_48|], 30=[|v_#memory_$Pointer$.offset_45|, v_prenex_17, v_prenex_15]} [2019-11-16 00:24:35,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:35,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:35,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:35,135 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:24:35,228 INFO L341 Elim1Store]: treesize reduction 36, result has 73.1 percent of original size [2019-11-16 00:24:35,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 135 treesize of output 209 [2019-11-16 00:24:35,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:35,451 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2019-11-16 00:24:35,451 INFO L567 ElimStorePlain]: treesize reduction 73, result has 80.5 percent of original size [2019-11-16 00:24:35,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:35,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:35,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:35,651 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-11-16 00:24:35,651 INFO L341 Elim1Store]: treesize reduction 24, result has 87.4 percent of original size [2019-11-16 00:24:35,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 154 treesize of output 263 [2019-11-16 00:24:35,653 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:35,877 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2019-11-16 00:24:35,877 INFO L567 ElimStorePlain]: treesize reduction 76, result has 77.8 percent of original size [2019-11-16 00:24:35,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:35,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:35,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:36,031 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-11-16 00:24:36,031 INFO L341 Elim1Store]: treesize reduction 24, result has 87.4 percent of original size [2019-11-16 00:24:36,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 146 treesize of output 265 [2019-11-16 00:24:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:36,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:36,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:36,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:36,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:36,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:24:36,049 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:36,328 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 97 [2019-11-16 00:24:36,328 INFO L567 ElimStorePlain]: treesize reduction 128, result has 66.1 percent of original size [2019-11-16 00:24:36,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:36,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:36,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:36,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:36,412 INFO L341 Elim1Store]: treesize reduction 16, result has 84.9 percent of original size [2019-11-16 00:24:36,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 202 [2019-11-16 00:24:36,414 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:36,626 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-11-16 00:24:36,626 INFO L567 ElimStorePlain]: treesize reduction 66, result has 79.4 percent of original size [2019-11-16 00:24:36,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-16 00:24:36,638 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:282, output treesize:433 [2019-11-16 00:24:36,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:36,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:36,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:36,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,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 7 new quantified variables, introduced 4 case distinctions, treesize of input 170 treesize of output 160 [2019-11-16 00:24:37,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,038 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:37,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,064 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 76 [2019-11-16 00:24:37,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,094 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 101 [2019-11-16 00:24:37,095 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:37,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,188 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 173 [2019-11-16 00:24:37,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,194 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:37,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,244 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 101 [2019-11-16 00:24:37,245 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:37,272 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:37,272 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 6 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 133 [2019-11-16 00:24:37,273 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:37,538 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 91 [2019-11-16 00:24:37,538 INFO L567 ElimStorePlain]: treesize reduction 125, result has 77.7 percent of original size [2019-11-16 00:24:37,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2019-11-16 00:24:37,540 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:922, output treesize:435 [2019-11-16 00:24:37,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,859 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-16 00:24:37,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-16 00:24:37,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-16 00:24:37,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:37,901 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:37,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 27 [2019-11-16 00:24:37,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217945036] [2019-11-16 00:24:37,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-16 00:24:37,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:37,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-16 00:24:37,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2019-11-16 00:24:37,903 INFO L87 Difference]: Start difference. First operand 294 states and 358 transitions. Second operand 27 states. [2019-11-16 00:24:38,593 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-11-16 00:24:40,565 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-11-16 00:24:44,408 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-11-16 00:24:44,840 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-11-16 00:24:45,194 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2019-11-16 00:24:47,474 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-16 00:24:54,328 WARN L191 SmtUtils]: Spent 6.66 s on a formula simplification. DAG size of input: 198 DAG size of output: 162 [2019-11-16 00:24:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:57,236 INFO L93 Difference]: Finished difference Result 412 states and 495 transitions. [2019-11-16 00:24:57,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-16 00:24:57,236 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 35 [2019-11-16 00:24:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:57,238 INFO L225 Difference]: With dead ends: 412 [2019-11-16 00:24:57,238 INFO L226 Difference]: Without dead ends: 412 [2019-11-16 00:24:57,239 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 17 SyntacticMatches, 14 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=318, Invalid=2132, Unknown=0, NotChecked=0, Total=2450 [2019-11-16 00:24:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-16 00:24:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 288. [2019-11-16 00:24:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-16 00:24:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 349 transitions. [2019-11-16 00:24:57,248 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 349 transitions. Word has length 35 [2019-11-16 00:24:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:57,249 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 349 transitions. [2019-11-16 00:24:57,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-16 00:24:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 349 transitions. [2019-11-16 00:24:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:24:57,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:57,250 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:24:57,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:57,453 INFO L410 AbstractCegarLoop]: === Iteration 27 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:24:57,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:57,454 INFO L82 PathProgramCache]: Analyzing trace with hash -373702135, now seen corresponding path program 1 times [2019-11-16 00:24:57,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:57,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723134927] [2019-11-16 00:24:57,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:57,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:57,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:57,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723134927] [2019-11-16 00:24:57,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:57,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:24:57,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99243764] [2019-11-16 00:24:57,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:24:57,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:57,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:24:57,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:24:57,695 INFO L87 Difference]: Start difference. First operand 288 states and 349 transitions. Second operand 11 states. [2019-11-16 00:24:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:58,360 INFO L93 Difference]: Finished difference Result 312 states and 374 transitions. [2019-11-16 00:24:58,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:24:58,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-11-16 00:24:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:24:58,362 INFO L225 Difference]: With dead ends: 312 [2019-11-16 00:24:58,362 INFO L226 Difference]: Without dead ends: 312 [2019-11-16 00:24:58,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:24:58,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-16 00:24:58,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 288. [2019-11-16 00:24:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-16 00:24:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 348 transitions. [2019-11-16 00:24:58,370 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 348 transitions. Word has length 38 [2019-11-16 00:24:58,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:24:58,370 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 348 transitions. [2019-11-16 00:24:58,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:24:58,370 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 348 transitions. [2019-11-16 00:24:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:24:58,371 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:24:58,371 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] [2019-11-16 00:24:58,372 INFO L410 AbstractCegarLoop]: === Iteration 28 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:24:58,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:58,372 INFO L82 PathProgramCache]: Analyzing trace with hash -847501463, now seen corresponding path program 1 times [2019-11-16 00:24:58,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:58,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234679143] [2019-11-16 00:24:58,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:58,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:58,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:24:59,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234679143] [2019-11-16 00:24:59,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776201991] [2019-11-16 00:24:59,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:59,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-16 00:24:59,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:59,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:24:59,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:59,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:59,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:24:59,434 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:59,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:59,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:24:59,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-16 00:24:59,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:59,503 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 23 treesize of output 22 [2019-11-16 00:24:59,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:59,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:59,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:24:59,526 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 23 treesize of output 22 [2019-11-16 00:24:59,527 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:24:59,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:59,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:24:59,541 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2019-11-16 00:24:59,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:24:59,991 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 84 treesize of output 95 [2019-11-16 00:24:59,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:59,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:59,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:59,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:24:59,994 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:00,043 INFO L567 ElimStorePlain]: treesize reduction 38, result has 63.5 percent of original size [2019-11-16 00:25:00,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:00,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:00,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 40 [2019-11-16 00:25:00,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-16 00:25:00,092 INFO L567 ElimStorePlain]: treesize reduction 26, result has 46.9 percent of original size [2019-11-16 00:25:00,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:25:00,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:16 [2019-11-16 00:25:00,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:25:00,164 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:00,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 32 [2019-11-16 00:25:00,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857551748] [2019-11-16 00:25:00,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-16 00:25:00,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:00,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-16 00:25:00,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-11-16 00:25:00,165 INFO L87 Difference]: Start difference. First operand 288 states and 348 transitions. Second operand 32 states. [2019-11-16 00:25:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:05,149 INFO L93 Difference]: Finished difference Result 404 states and 495 transitions. [2019-11-16 00:25:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-16 00:25:05,150 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 38 [2019-11-16 00:25:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:05,152 INFO L225 Difference]: With dead ends: 404 [2019-11-16 00:25:05,152 INFO L226 Difference]: Without dead ends: 404 [2019-11-16 00:25:05,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=561, Invalid=3995, Unknown=0, NotChecked=0, Total=4556 [2019-11-16 00:25:05,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-11-16 00:25:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 336. [2019-11-16 00:25:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-16 00:25:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 410 transitions. [2019-11-16 00:25:05,164 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 410 transitions. Word has length 38 [2019-11-16 00:25:05,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:05,164 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 410 transitions. [2019-11-16 00:25:05,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-16 00:25:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 410 transitions. [2019-11-16 00:25:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:25:05,165 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:05,166 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:05,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:05,369 INFO L410 AbstractCegarLoop]: === Iteration 29 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:25:05,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash -271233411, now seen corresponding path program 1 times [2019-11-16 00:25:05,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:05,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250454924] [2019-11-16 00:25:05,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:05,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:05,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:05,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250454924] [2019-11-16 00:25:05,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179381381] [2019-11-16 00:25:05,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:05,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-16 00:25:05,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:06,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:25:06,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:06,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:06,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:06,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-11-16 00:25:06,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:06,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:06,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:06,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:06,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:06,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:06,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:06,136 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2019-11-16 00:25:06,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:06,193 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 23 treesize of output 22 [2019-11-16 00:25:06,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:06,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:06,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:06,228 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 23 treesize of output 22 [2019-11-16 00:25:06,228 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:06,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:06,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:06,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:83 [2019-11-16 00:25:06,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-11-16 00:25:06,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:06,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:06,660 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:06,660 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 96 treesize of output 67 [2019-11-16 00:25:06,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:06,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:06,661 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:06,690 INFO L567 ElimStorePlain]: treesize reduction 22, result has 72.2 percent of original size [2019-11-16 00:25:06,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:06,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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 18 [2019-11-16 00:25:06,693 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:06,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:06,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:06,698 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:144, output treesize:7 [2019-11-16 00:25:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:25:06,730 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:06,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2019-11-16 00:25:06,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675264367] [2019-11-16 00:25:06,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-16 00:25:06,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:06,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-16 00:25:06,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:25:06,732 INFO L87 Difference]: Start difference. First operand 336 states and 410 transitions. Second operand 28 states. [2019-11-16 00:25:07,947 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-11-16 00:25:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:08,994 INFO L93 Difference]: Finished difference Result 347 states and 428 transitions. [2019-11-16 00:25:08,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:25:08,994 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2019-11-16 00:25:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:08,998 INFO L225 Difference]: With dead ends: 347 [2019-11-16 00:25:08,998 INFO L226 Difference]: Without dead ends: 347 [2019-11-16 00:25:08,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2019-11-16 00:25:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-11-16 00:25:09,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 261. [2019-11-16 00:25:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-16 00:25:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 313 transitions. [2019-11-16 00:25:09,009 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 313 transitions. Word has length 38 [2019-11-16 00:25:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:09,010 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 313 transitions. [2019-11-16 00:25:09,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-16 00:25:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 313 transitions. [2019-11-16 00:25:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-16 00:25:09,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:09,011 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:09,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:09,215 INFO L410 AbstractCegarLoop]: === Iteration 30 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:25:09,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1658123063, now seen corresponding path program 1 times [2019-11-16 00:25:09,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:09,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499210051] [2019-11-16 00:25:09,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:09,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:09,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:09,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499210051] [2019-11-16 00:25:09,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:09,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:25:09,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70170951] [2019-11-16 00:25:09,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:25:09,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:09,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:25:09,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:25:09,382 INFO L87 Difference]: Start difference. First operand 261 states and 313 transitions. Second operand 11 states. [2019-11-16 00:25:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:10,076 INFO L93 Difference]: Finished difference Result 280 states and 325 transitions. [2019-11-16 00:25:10,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:25:10,076 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-11-16 00:25:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:10,077 INFO L225 Difference]: With dead ends: 280 [2019-11-16 00:25:10,077 INFO L226 Difference]: Without dead ends: 280 [2019-11-16 00:25:10,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:25:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-16 00:25:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 261. [2019-11-16 00:25:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-16 00:25:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 309 transitions. [2019-11-16 00:25:10,085 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 309 transitions. Word has length 40 [2019-11-16 00:25:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:10,085 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 309 transitions. [2019-11-16 00:25:10,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:25:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 309 transitions. [2019-11-16 00:25:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-16 00:25:10,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:10,086 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:10,086 INFO L410 AbstractCegarLoop]: === Iteration 31 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:25:10,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1950899307, now seen corresponding path program 1 times [2019-11-16 00:25:10,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:10,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103815686] [2019-11-16 00:25:10,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:10,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:10,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:25:10,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103815686] [2019-11-16 00:25:10,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380249853] [2019-11-16 00:25:10,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:10,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-16 00:25:10,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:10,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:10,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:10,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:10,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:10,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:10,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:10,592 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 21 treesize of output 20 [2019-11-16 00:25:10,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:10,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:10,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:10,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-11-16 00:25:10,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:10,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:10,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 104 [2019-11-16 00:25:10,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:10,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:10,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:10,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:10,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:10,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-16 00:25:10,713 INFO L567 ElimStorePlain]: treesize reduction 108, result has 30.8 percent of original size [2019-11-16 00:25:10,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:10,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2019-11-16 00:25:11,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:11,036 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:11,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2019-11-16 00:25:11,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:11,058 INFO L567 ElimStorePlain]: treesize reduction 30, result has 36.2 percent of original size [2019-11-16 00:25:11,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:11,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:5 [2019-11-16 00:25:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:25:11,070 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:11,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2019-11-16 00:25:11,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020336899] [2019-11-16 00:25:11,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-16 00:25:11,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:11,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-16 00:25:11,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:25:11,072 INFO L87 Difference]: Start difference. First operand 261 states and 309 transitions. Second operand 26 states. [2019-11-16 00:25:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:13,600 INFO L93 Difference]: Finished difference Result 312 states and 372 transitions. [2019-11-16 00:25:13,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:25:13,600 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 40 [2019-11-16 00:25:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:13,602 INFO L225 Difference]: With dead ends: 312 [2019-11-16 00:25:13,602 INFO L226 Difference]: Without dead ends: 312 [2019-11-16 00:25:13,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=303, Invalid=1859, Unknown=0, NotChecked=0, Total=2162 [2019-11-16 00:25:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-16 00:25:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 273. [2019-11-16 00:25:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-16 00:25:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 324 transitions. [2019-11-16 00:25:13,610 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 324 transitions. Word has length 40 [2019-11-16 00:25:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:13,610 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 324 transitions. [2019-11-16 00:25:13,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-16 00:25:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 324 transitions. [2019-11-16 00:25:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-16 00:25:13,611 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:13,611 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:13,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:13,815 INFO L410 AbstractCegarLoop]: === Iteration 32 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:25:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:13,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1950899308, now seen corresponding path program 1 times [2019-11-16 00:25:13,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:13,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122859909] [2019-11-16 00:25:13,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:13,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:13,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:25:14,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122859909] [2019-11-16 00:25:14,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254338063] [2019-11-16 00:25:14,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:14,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-16 00:25:14,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:14,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:14,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:14,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:14,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:14,465 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:14,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:14,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:14,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-11-16 00:25:14,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:14,528 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 21 treesize of output 20 [2019-11-16 00:25:14,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:14,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:14,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:14,556 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 21 treesize of output 20 [2019-11-16 00:25:14,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:14,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:14,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:14,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2019-11-16 00:25:14,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:14,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:14,636 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:25:14,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:14,648 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 66 treesize of output 69 [2019-11-16 00:25:14,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:14,703 INFO L567 ElimStorePlain]: treesize reduction 26, result has 75.5 percent of original size [2019-11-16 00:25:14,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:14,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:14,715 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 36 treesize of output 34 [2019-11-16 00:25:14,715 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:14,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:14,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:14,740 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:72 [2019-11-16 00:25:15,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:15,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:15,114 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:25:15,117 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:15,117 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 2 case distinctions, treesize of input 57 treesize of output 38 [2019-11-16 00:25:15,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:15,143 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-11-16 00:25:15,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:15,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:15,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-16 00:25:15,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:15,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:15,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:15,156 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:9 [2019-11-16 00:25:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:25:15,194 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:15,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2019-11-16 00:25:15,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887814734] [2019-11-16 00:25:15,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-16 00:25:15,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:15,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-16 00:25:15,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:25:15,196 INFO L87 Difference]: Start difference. First operand 273 states and 324 transitions. Second operand 26 states. [2019-11-16 00:25:16,103 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2019-11-16 00:25:17,017 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-11-16 00:25:18,253 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-11-16 00:25:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:20,013 INFO L93 Difference]: Finished difference Result 322 states and 385 transitions. [2019-11-16 00:25:20,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-16 00:25:20,014 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 40 [2019-11-16 00:25:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:20,015 INFO L225 Difference]: With dead ends: 322 [2019-11-16 00:25:20,015 INFO L226 Difference]: Without dead ends: 322 [2019-11-16 00:25:20,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=501, Invalid=2921, Unknown=0, NotChecked=0, Total=3422 [2019-11-16 00:25:20,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-16 00:25:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 275. [2019-11-16 00:25:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-16 00:25:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 324 transitions. [2019-11-16 00:25:20,024 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 324 transitions. Word has length 40 [2019-11-16 00:25:20,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:20,024 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 324 transitions. [2019-11-16 00:25:20,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-16 00:25:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 324 transitions. [2019-11-16 00:25:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:25:20,025 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:20,026 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] [2019-11-16 00:25:20,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:20,231 INFO L410 AbstractCegarLoop]: === Iteration 33 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:25:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:20,231 INFO L82 PathProgramCache]: Analyzing trace with hash -278266052, now seen corresponding path program 1 times [2019-11-16 00:25:20,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:20,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107898676] [2019-11-16 00:25:20,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:20,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:20,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:25:20,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107898676] [2019-11-16 00:25:20,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457380423] [2019-11-16 00:25:20,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-16 00:25:20,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:20,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:25:20,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:20,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:20,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:20,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-16 00:25:20,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:20,990 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 21 treesize of output 20 [2019-11-16 00:25:20,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:21,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-11-16 00:25:21,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:21,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:21,075 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 30 treesize of output 32 [2019-11-16 00:25:21,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:21,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-11-16 00:25:21,224 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:21,224 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 17 treesize of output 21 [2019-11-16 00:25:21,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:21,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:65 [2019-11-16 00:25:21,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:21,372 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:21,372 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 168 [2019-11-16 00:25:21,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,427 INFO L567 ElimStorePlain]: treesize reduction 104, result has 35.8 percent of original size [2019-11-16 00:25:21,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:58 [2019-11-16 00:25:21,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:21,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:21,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:21,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2019-11-16 00:25:21,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:21,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:21,548 INFO L341 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-11-16 00:25:21,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 61 treesize of output 103 [2019-11-16 00:25:21,549 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,632 INFO L567 ElimStorePlain]: treesize reduction 26, result has 82.1 percent of original size [2019-11-16 00:25:21,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:21,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-16 00:25:21,633 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:119 [2019-11-16 00:25:21,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:21,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:21,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:21,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:21,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:21,896 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-11-16 00:25:21,897 INFO L341 Elim1Store]: treesize reduction 10, result has 95.6 percent of original size [2019-11-16 00:25:21,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 261 [2019-11-16 00:25:21,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:21,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:21,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:21,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:21,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:21,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:21,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:22,013 INFO L341 Elim1Store]: treesize reduction 28, result has 79.3 percent of original size [2019-11-16 00:25:22,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 155 [2019-11-16 00:25:22,014 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:22,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:22,110 INFO L341 Elim1Store]: treesize reduction 28, result has 79.9 percent of original size [2019-11-16 00:25:22,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 89 treesize of output 157 [2019-11-16 00:25:22,111 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,369 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 50 [2019-11-16 00:25:22,369 INFO L567 ElimStorePlain]: treesize reduction 890, result has 20.9 percent of original size [2019-11-16 00:25:22,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:22,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:22,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-16 00:25:22,371 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:277, output treesize:251 [2019-11-16 00:25:22,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:22,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:22,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:22,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:22,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:23,913 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 59 [2019-11-16 00:25:24,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:24,366 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-16 00:25:24,366 INFO L341 Elim1Store]: treesize reduction 10, result has 92.1 percent of original size [2019-11-16 00:25:24,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 151 [2019-11-16 00:25:24,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,387 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:24,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:24,598 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-11-16 00:25:24,598 INFO L341 Elim1Store]: treesize reduction 10, result has 95.1 percent of original size [2019-11-16 00:25:24,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 155 treesize of output 234 [2019-11-16 00:25:24,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,701 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:24,897 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 78 [2019-11-16 00:25:24,897 INFO L567 ElimStorePlain]: treesize reduction 126, result has 57.0 percent of original size [2019-11-16 00:25:24,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-11-16 00:25:24,900 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:283, output treesize:167 [2019-11-16 00:25:24,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:25:24,978 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:24,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2019-11-16 00:25:24,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73048146] [2019-11-16 00:25:24,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-16 00:25:24,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:24,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-16 00:25:24,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1530, Unknown=0, NotChecked=0, Total=1640 [2019-11-16 00:25:24,979 INFO L87 Difference]: Start difference. First operand 275 states and 324 transitions. Second operand 41 states. [2019-11-16 00:25:26,363 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-11-16 00:25:26,627 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 54 [2019-11-16 00:25:26,978 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-11-16 00:25:27,228 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 93 [2019-11-16 00:25:27,500 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 95 [2019-11-16 00:25:27,753 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-16 00:25:28,423 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 87 [2019-11-16 00:25:29,072 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 92 [2019-11-16 00:25:29,254 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2019-11-16 00:25:29,653 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 94 [2019-11-16 00:25:29,816 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2019-11-16 00:25:30,388 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 100 [2019-11-16 00:25:30,628 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 93 [2019-11-16 00:25:31,338 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 88 [2019-11-16 00:25:31,511 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2019-11-16 00:25:32,314 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 93 [2019-11-16 00:25:32,651 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2019-11-16 00:25:33,520 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-16 00:25:34,413 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-16 00:25:34,830 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-11-16 00:25:39,130 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 99 [2019-11-16 00:25:39,446 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2019-11-16 00:25:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:39,717 INFO L93 Difference]: Finished difference Result 472 states and 577 transitions. [2019-11-16 00:25:39,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-11-16 00:25:39,718 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 46 [2019-11-16 00:25:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:39,721 INFO L225 Difference]: With dead ends: 472 [2019-11-16 00:25:39,721 INFO L226 Difference]: Without dead ends: 472 [2019-11-16 00:25:39,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2258 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1082, Invalid=8230, Unknown=0, NotChecked=0, Total=9312 [2019-11-16 00:25:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-16 00:25:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 416. [2019-11-16 00:25:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:25:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 506 transitions. [2019-11-16 00:25:39,737 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 506 transitions. Word has length 46 [2019-11-16 00:25:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:39,737 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 506 transitions. [2019-11-16 00:25:39,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-16 00:25:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 506 transitions. [2019-11-16 00:25:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:25:39,739 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:39,739 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:39,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:39,943 INFO L410 AbstractCegarLoop]: === Iteration 34 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:25:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:39,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1878899116, now seen corresponding path program 1 times [2019-11-16 00:25:39,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:39,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260835683] [2019-11-16 00:25:39,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:39,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:39,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:40,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260835683] [2019-11-16 00:25:40,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303076432] [2019-11-16 00:25:40,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:41,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-16 00:25:41,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:41,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:41,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:41,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:41,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:41,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2019-11-16 00:25:43,178 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~x~0.base_BEFORE_CALL_19 Int) (main_~tail~0.offset Int)) (and (<= main_~tail~0.offset 0) (<= (+ v_main_~x~0.base_BEFORE_CALL_19 2) (select (select |c_#memory_$Pointer$.base| v_main_~x~0.base_BEFORE_CALL_19) (+ main_~tail~0.offset 4))))) is different from true [2019-11-16 00:25:44,213 WARN L191 SmtUtils]: Spent 817.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-16 00:25:44,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:25:44,266 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:44,267 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 46 treesize of output 102 [2019-11-16 00:25:44,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:44,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:44,300 INFO L567 ElimStorePlain]: treesize reduction 83, result has 35.2 percent of original size [2019-11-16 00:25:44,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:44,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-11-16 00:25:44,517 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 32 treesize of output 14 [2019-11-16 00:25:44,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:44,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:44,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:44,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-11-16 00:25:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:44,532 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:44,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2019-11-16 00:25:44,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314267971] [2019-11-16 00:25:44,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-16 00:25:44,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:44,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-16 00:25:44,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1030, Unknown=1, NotChecked=64, Total=1190 [2019-11-16 00:25:44,533 INFO L87 Difference]: Start difference. First operand 416 states and 506 transitions. Second operand 35 states. [2019-11-16 00:25:46,872 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-11-16 00:25:49,634 WARN L191 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-11-16 00:25:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:54,366 INFO L93 Difference]: Finished difference Result 528 states and 627 transitions. [2019-11-16 00:25:54,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-16 00:25:54,366 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 48 [2019-11-16 00:25:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:54,369 INFO L225 Difference]: With dead ends: 528 [2019-11-16 00:25:54,369 INFO L226 Difference]: Without dead ends: 528 [2019-11-16 00:25:54,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=390, Invalid=3273, Unknown=1, NotChecked=118, Total=3782 [2019-11-16 00:25:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-16 00:25:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 416. [2019-11-16 00:25:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:25:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 505 transitions. [2019-11-16 00:25:54,382 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 505 transitions. Word has length 48 [2019-11-16 00:25:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:54,391 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 505 transitions. [2019-11-16 00:25:54,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-16 00:25:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 505 transitions. [2019-11-16 00:25:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:25:54,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:54,393 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:54,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:54,597 INFO L410 AbstractCegarLoop]: === Iteration 35 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:25:54,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:54,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1878899115, now seen corresponding path program 1 times [2019-11-16 00:25:54,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:54,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357281470] [2019-11-16 00:25:54,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:54,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:54,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:54,953 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-11-16 00:25:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:25:55,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357281470] [2019-11-16 00:25:55,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714784019] [2019-11-16 00:25:55,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:56,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-16 00:25:56,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:56,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:56,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:56,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:56,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:56,330 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:56,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:56,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:56,344 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:55 [2019-11-16 00:25:56,493 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 31 treesize of output 19 [2019-11-16 00:25:56,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-16 00:25:56,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:56,507 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 32 treesize of output 14 [2019-11-16 00:25:56,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:56,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:56,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:56,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:12 [2019-11-16 00:25:59,586 WARN L191 SmtUtils]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-16 00:25:59,590 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_BEFORE_CALL_6|], 6=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_2|]} [2019-11-16 00:25:59,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:25:59,595 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 61 treesize of output 42 [2019-11-16 00:25:59,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:59,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:59,620 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:25:59,634 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:59,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 75 [2019-11-16 00:25:59,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:25:59,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:59,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:25:59,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-16 00:25:59,683 INFO L567 ElimStorePlain]: treesize reduction 140, result has 39.1 percent of original size [2019-11-16 00:25:59,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:25:59,683 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:109, output treesize:63 [2019-11-16 00:25:59,991 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-11-16 00:25:59,994 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 40 treesize of output 22 [2019-11-16 00:25:59,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:00,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:00,010 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:26:00,010 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2019-11-16 00:26:00,010 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:00,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:00,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:00,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:14 [2019-11-16 00:26:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:00,082 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:00,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2019-11-16 00:26:00,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629624370] [2019-11-16 00:26:00,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-16 00:26:00,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:00,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-16 00:26:00,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1297, Unknown=1, NotChecked=0, Total=1406 [2019-11-16 00:26:00,084 INFO L87 Difference]: Start difference. First operand 416 states and 505 transitions. Second operand 38 states. [2019-11-16 00:26:12,768 WARN L191 SmtUtils]: Spent 7.31 s on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-11-16 00:26:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:18,120 INFO L93 Difference]: Finished difference Result 549 states and 645 transitions. [2019-11-16 00:26:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-16 00:26:18,120 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 48 [2019-11-16 00:26:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:18,123 INFO L225 Difference]: With dead ends: 549 [2019-11-16 00:26:18,123 INFO L226 Difference]: Without dead ends: 549 [2019-11-16 00:26:18,124 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=398, Invalid=3632, Unknown=2, NotChecked=0, Total=4032 [2019-11-16 00:26:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-11-16 00:26:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 426. [2019-11-16 00:26:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-16 00:26:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 514 transitions. [2019-11-16 00:26:18,136 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 514 transitions. Word has length 48 [2019-11-16 00:26:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:18,137 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 514 transitions. [2019-11-16 00:26:18,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-16 00:26:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 514 transitions. [2019-11-16 00:26:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:26:18,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:18,138 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:18,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:18,344 INFO L410 AbstractCegarLoop]: === Iteration 36 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:26:18,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1503886746, now seen corresponding path program 1 times [2019-11-16 00:26:18,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:18,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185894632] [2019-11-16 00:26:18,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:18,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:18,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:26:18,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185894632] [2019-11-16 00:26:18,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772872945] [2019-11-16 00:26:18,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:18,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:26:18,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:18,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:26:18,776 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:18,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 14 [2019-11-16 00:26:18,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090109136] [2019-11-16 00:26:18,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:26:18,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:18,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:26:18,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:26:18,777 INFO L87 Difference]: Start difference. First operand 426 states and 514 transitions. Second operand 14 states. [2019-11-16 00:26:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:19,695 INFO L93 Difference]: Finished difference Result 441 states and 528 transitions. [2019-11-16 00:26:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:26:19,696 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-11-16 00:26:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:19,697 INFO L225 Difference]: With dead ends: 441 [2019-11-16 00:26:19,697 INFO L226 Difference]: Without dead ends: 441 [2019-11-16 00:26:19,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:26:19,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-16 00:26:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 426. [2019-11-16 00:26:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-16 00:26:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 510 transitions. [2019-11-16 00:26:19,708 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 510 transitions. Word has length 50 [2019-11-16 00:26:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:19,708 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 510 transitions. [2019-11-16 00:26:19,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:26:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 510 transitions. [2019-11-16 00:26:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:26:19,709 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:19,710 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:19,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:19,913 INFO L410 AbstractCegarLoop]: === Iteration 37 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:26:19,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:19,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1856771569, now seen corresponding path program 1 times [2019-11-16 00:26:19,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:19,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077728047] [2019-11-16 00:26:19,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:19,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:19,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:26:20,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077728047] [2019-11-16 00:26:20,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:20,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:26:20,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000067096] [2019-11-16 00:26:20,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:26:20,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:20,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:26:20,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:26:20,003 INFO L87 Difference]: Start difference. First operand 426 states and 510 transitions. Second operand 6 states. [2019-11-16 00:26:20,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:20,336 INFO L93 Difference]: Finished difference Result 435 states and 518 transitions. [2019-11-16 00:26:20,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:26:20,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-16 00:26:20,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:20,338 INFO L225 Difference]: With dead ends: 435 [2019-11-16 00:26:20,339 INFO L226 Difference]: Without dead ends: 403 [2019-11-16 00:26:20,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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-16 00:26:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-11-16 00:26:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 397. [2019-11-16 00:26:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-16 00:26:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 476 transitions. [2019-11-16 00:26:20,352 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 476 transitions. Word has length 52 [2019-11-16 00:26:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:20,352 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 476 transitions. [2019-11-16 00:26:20,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:26:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 476 transitions. [2019-11-16 00:26:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:26:20,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:20,353 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:20,354 INFO L410 AbstractCegarLoop]: === Iteration 38 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:26:20,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1009789383, now seen corresponding path program 1 times [2019-11-16 00:26:20,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:20,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19346676] [2019-11-16 00:26:20,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:20,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:20,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:26:20,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19346676] [2019-11-16 00:26:20,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186563063] [2019-11-16 00:26:20,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:20,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-16 00:26:20,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:20,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:26:20,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:20,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:20,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:20,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-16 00:26:20,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:20,966 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 21 treesize of output 20 [2019-11-16 00:26:20,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:20,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:20,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:20,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-16 00:26:21,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:21,085 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:21,085 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 3 case distinctions, treesize of input 48 treesize of output 103 [2019-11-16 00:26:21,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:21,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:21,125 INFO L567 ElimStorePlain]: treesize reduction 42, result has 52.3 percent of original size [2019-11-16 00:26:21,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:26:21,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2019-11-16 00:26:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:26:21,520 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:21,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2019-11-16 00:26:21,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589285027] [2019-11-16 00:26:21,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-16 00:26:21,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:21,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-16 00:26:21,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:26:21,522 INFO L87 Difference]: Start difference. First operand 397 states and 476 transitions. Second operand 28 states. [2019-11-16 00:26:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:25,382 INFO L93 Difference]: Finished difference Result 381 states and 441 transitions. [2019-11-16 00:26:25,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-16 00:26:25,382 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2019-11-16 00:26:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:25,384 INFO L225 Difference]: With dead ends: 381 [2019-11-16 00:26:25,384 INFO L226 Difference]: Without dead ends: 373 [2019-11-16 00:26:25,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=497, Invalid=2809, Unknown=0, NotChecked=0, Total=3306 [2019-11-16 00:26:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-16 00:26:25,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 282. [2019-11-16 00:26:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-16 00:26:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 326 transitions. [2019-11-16 00:26:25,394 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 326 transitions. Word has length 51 [2019-11-16 00:26:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:25,394 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 326 transitions. [2019-11-16 00:26:25,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-16 00:26:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 326 transitions. [2019-11-16 00:26:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:26:25,396 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:25,396 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:25,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:25,600 INFO L410 AbstractCegarLoop]: === Iteration 39 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:26:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:25,601 INFO L82 PathProgramCache]: Analyzing trace with hash 615313155, now seen corresponding path program 1 times [2019-11-16 00:26:25,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:25,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948363662] [2019-11-16 00:26:25,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:25,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:25,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:25,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948363662] [2019-11-16 00:26:25,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732246184] [2019-11-16 00:26:25,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:26,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-16 00:26:26,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:26,421 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_72|], 6=[|v_#memory_$Pointer$.offset_55|]} [2019-11-16 00:26:26,439 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:26,439 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 25 treesize of output 60 [2019-11-16 00:26:26,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:26,474 INFO L567 ElimStorePlain]: treesize reduction 22, result has 75.3 percent of original size [2019-11-16 00:26:26,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:26,506 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:26,506 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 59 treesize of output 106 [2019-11-16 00:26:26,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:26:26,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:26:26,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:26:26,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,512 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-16 00:26:26,681 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 44 [2019-11-16 00:26:26,681 INFO L567 ElimStorePlain]: treesize reduction 789, result has 12.2 percent of original size [2019-11-16 00:26:26,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:26:26,683 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:103 [2019-11-16 00:26:26,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:26,814 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 46 treesize of output 32 [2019-11-16 00:26:26,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:26,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:26,836 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:26,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 68 [2019-11-16 00:26:26,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:26,839 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:26:26,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:26,845 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 55 treesize of output 41 [2019-11-16 00:26:26,845 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:26,920 INFO L567 ElimStorePlain]: treesize reduction 26, result has 78.5 percent of original size [2019-11-16 00:26:26,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-16 00:26:26,920 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:165, output treesize:95 [2019-11-16 00:26:27,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:27,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-16 00:26:27,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:27,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:27,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:27,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:10 [2019-11-16 00:26:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:27,115 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:27,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2019-11-16 00:26:27,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311520602] [2019-11-16 00:26:27,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-16 00:26:27,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:27,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-16 00:26:27,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2019-11-16 00:26:27,116 INFO L87 Difference]: Start difference. First operand 282 states and 326 transitions. Second operand 31 states. [2019-11-16 00:26:28,850 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-11-16 00:26:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:30,499 INFO L93 Difference]: Finished difference Result 310 states and 350 transitions. [2019-11-16 00:26:30,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-16 00:26:30,500 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2019-11-16 00:26:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:30,502 INFO L225 Difference]: With dead ends: 310 [2019-11-16 00:26:30,502 INFO L226 Difference]: Without dead ends: 310 [2019-11-16 00:26:30,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=405, Invalid=3135, Unknown=0, NotChecked=0, Total=3540 [2019-11-16 00:26:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-16 00:26:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 282. [2019-11-16 00:26:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-16 00:26:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 325 transitions. [2019-11-16 00:26:30,530 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 325 transitions. Word has length 53 [2019-11-16 00:26:30,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:30,530 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 325 transitions. [2019-11-16 00:26:30,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-16 00:26:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 325 transitions. [2019-11-16 00:26:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:26:30,531 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:30,531 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:30,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:30,732 INFO L410 AbstractCegarLoop]: === Iteration 40 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:26:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:30,732 INFO L82 PathProgramCache]: Analyzing trace with hash 615313156, now seen corresponding path program 1 times [2019-11-16 00:26:30,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:30,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95216784] [2019-11-16 00:26:30,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:30,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:30,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:31,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95216784] [2019-11-16 00:26:31,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106122341] [2019-11-16 00:26:31,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:31,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-16 00:26:31,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:31,880 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_73|], 6=[|v_#memory_$Pointer$.offset_56|]} [2019-11-16 00:26:31,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:31,905 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 25 treesize of output 60 [2019-11-16 00:26:31,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:31,948 INFO L567 ElimStorePlain]: treesize reduction 22, result has 75.3 percent of original size [2019-11-16 00:26:31,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:31,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:31,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 106 [2019-11-16 00:26:31,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:31,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:26:31,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:31,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:31,988 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-16 00:26:32,087 INFO L567 ElimStorePlain]: treesize reduction 416, result has 18.6 percent of original size [2019-11-16 00:26:32,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:32,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:26:32,088 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:91 [2019-11-16 00:26:32,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:32,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:32,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:32,375 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-16 00:26:32,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:32,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:26:32,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:26:32,479 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-11-16 00:26:32,482 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 33 treesize of output 17 [2019-11-16 00:26:32,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:32,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:32,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-16 00:26:32,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:32,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:32,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:32,500 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:13 [2019-11-16 00:26:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:32,548 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:32,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 35 [2019-11-16 00:26:32,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342251032] [2019-11-16 00:26:32,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-16 00:26:32,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:32,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-16 00:26:32,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2019-11-16 00:26:32,549 INFO L87 Difference]: Start difference. First operand 282 states and 325 transitions. Second operand 36 states. [2019-11-16 00:26:34,557 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-16 00:26:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:35,538 INFO L93 Difference]: Finished difference Result 311 states and 349 transitions. [2019-11-16 00:26:35,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-16 00:26:35,538 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 53 [2019-11-16 00:26:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:35,540 INFO L225 Difference]: With dead ends: 311 [2019-11-16 00:26:35,540 INFO L226 Difference]: Without dead ends: 311 [2019-11-16 00:26:35,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=430, Invalid=3602, Unknown=0, NotChecked=0, Total=4032 [2019-11-16 00:26:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-11-16 00:26:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 282. [2019-11-16 00:26:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-16 00:26:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 324 transitions. [2019-11-16 00:26:35,548 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 324 transitions. Word has length 53 [2019-11-16 00:26:35,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:35,548 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 324 transitions. [2019-11-16 00:26:35,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-16 00:26:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 324 transitions. [2019-11-16 00:26:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:26:35,550 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:35,550 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:35,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:35,754 INFO L410 AbstractCegarLoop]: === Iteration 41 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:26:35,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:35,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1747880371, now seen corresponding path program 1 times [2019-11-16 00:26:35,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:35,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938941299] [2019-11-16 00:26:35,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:35,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:35,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:26:36,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938941299] [2019-11-16 00:26:36,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702221898] [2019-11-16 00:26:36,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:36,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-16 00:26:36,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:37,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:26:37,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:37,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:37,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:26:37,132 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:37,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:37,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:37,156 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2019-11-16 00:26:37,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:37,242 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 21 treesize of output 20 [2019-11-16 00:26:37,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:37,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:37,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:37,274 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 21 treesize of output 20 [2019-11-16 00:26:37,274 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:37,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:37,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:37,295 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2019-11-16 00:26:37,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:37,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:37,368 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 30 treesize of output 32 [2019-11-16 00:26:37,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:37,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:37,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:37,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:37,397 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 30 treesize of output 32 [2019-11-16 00:26:37,398 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:37,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:37,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:37,420 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2019-11-16 00:26:37,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:37,955 INFO L341 Elim1Store]: treesize reduction 42, result has 73.4 percent of original size [2019-11-16 00:26:37,955 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 7 new quantified variables, introduced 4 case distinctions, treesize of input 257 treesize of output 234 [2019-11-16 00:26:37,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:37,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:37,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:37,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:37,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:26:37,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:26:37,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:37,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:37,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:37,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:37,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:26:37,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:26:37,963 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:26:38,023 INFO L567 ElimStorePlain]: treesize reduction 193, result has 45.8 percent of original size [2019-11-16 00:26:38,025 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:26:38,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:38,059 INFO L341 Elim1Store]: treesize reduction 16, result has 72.9 percent of original size [2019-11-16 00:26:38,059 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 154 treesize of output 109 [2019-11-16 00:26:38,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:38,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:38,061 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:26:38,100 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.6 percent of original size [2019-11-16 00:26:38,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:26:38,100 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:271, output treesize:77 [2019-11-16 00:26:38,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:38,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:38,339 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:26:38,343 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:38,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 51 [2019-11-16 00:26:38,344 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:26:38,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:38,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:38,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:38,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-11-16 00:26:38,363 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:38,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:38,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:38,371 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:7 [2019-11-16 00:26:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:26:38,427 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:38,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 38 [2019-11-16 00:26:38,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451787494] [2019-11-16 00:26:38,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-16 00:26:38,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:38,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-16 00:26:38,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1284, Unknown=0, NotChecked=0, Total=1406 [2019-11-16 00:26:38,428 INFO L87 Difference]: Start difference. First operand 282 states and 324 transitions. Second operand 38 states. [2019-11-16 00:26:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:44,787 INFO L93 Difference]: Finished difference Result 376 states and 443 transitions. [2019-11-16 00:26:44,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-11-16 00:26:44,788 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 55 [2019-11-16 00:26:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:44,790 INFO L225 Difference]: With dead ends: 376 [2019-11-16 00:26:44,790 INFO L226 Difference]: Without dead ends: 376 [2019-11-16 00:26:44,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1654 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=672, Invalid=5648, Unknown=0, NotChecked=0, Total=6320 [2019-11-16 00:26:44,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-16 00:26:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 308. [2019-11-16 00:26:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-16 00:26:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 356 transitions. [2019-11-16 00:26:44,799 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 356 transitions. Word has length 55 [2019-11-16 00:26:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:44,799 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 356 transitions. [2019-11-16 00:26:44,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-16 00:26:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 356 transitions. [2019-11-16 00:26:44,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-16 00:26:44,801 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:44,801 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:45,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:45,005 INFO L410 AbstractCegarLoop]: === Iteration 42 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:26:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:45,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1282159509, now seen corresponding path program 1 times [2019-11-16 00:26:45,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:45,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953419104] [2019-11-16 00:26:45,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:45,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:45,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:26:45,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953419104] [2019-11-16 00:26:45,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:45,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:26:45,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806023345] [2019-11-16 00:26:45,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:26:45,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:45,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:26:45,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:26:45,094 INFO L87 Difference]: Start difference. First operand 308 states and 356 transitions. Second operand 8 states. [2019-11-16 00:26:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:45,762 INFO L93 Difference]: Finished difference Result 314 states and 360 transitions. [2019-11-16 00:26:45,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:26:45,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-11-16 00:26:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:45,764 INFO L225 Difference]: With dead ends: 314 [2019-11-16 00:26:45,764 INFO L226 Difference]: Without dead ends: 314 [2019-11-16 00:26:45,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:26:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-16 00:26:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 307. [2019-11-16 00:26:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-16 00:26:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 354 transitions. [2019-11-16 00:26:45,772 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 354 transitions. Word has length 62 [2019-11-16 00:26:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:45,772 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 354 transitions. [2019-11-16 00:26:45,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:26:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 354 transitions. [2019-11-16 00:26:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-16 00:26:45,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:45,774 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:45,774 INFO L410 AbstractCegarLoop]: === Iteration 43 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:26:45,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:45,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1282159510, now seen corresponding path program 1 times [2019-11-16 00:26:45,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:45,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208294614] [2019-11-16 00:26:45,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:45,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:45,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-16 00:26:45,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208294614] [2019-11-16 00:26:45,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:45,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:26:45,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850958663] [2019-11-16 00:26:45,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:26:45,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:26:45,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:26:45,880 INFO L87 Difference]: Start difference. First operand 307 states and 354 transitions. Second operand 8 states. [2019-11-16 00:26:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:46,746 INFO L93 Difference]: Finished difference Result 310 states and 353 transitions. [2019-11-16 00:26:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:26:46,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-11-16 00:26:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:46,748 INFO L225 Difference]: With dead ends: 310 [2019-11-16 00:26:46,749 INFO L226 Difference]: Without dead ends: 310 [2019-11-16 00:26:46,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:26:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-16 00:26:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 303. [2019-11-16 00:26:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-11-16 00:26:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 347 transitions. [2019-11-16 00:26:46,758 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 347 transitions. Word has length 62 [2019-11-16 00:26:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:46,761 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 347 transitions. [2019-11-16 00:26:46,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:26:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 347 transitions. [2019-11-16 00:26:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-16 00:26:46,763 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:46,763 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:46,763 INFO L410 AbstractCegarLoop]: === Iteration 44 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:26:46,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:46,764 INFO L82 PathProgramCache]: Analyzing trace with hash -318391556, now seen corresponding path program 1 times [2019-11-16 00:26:46,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:46,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851699644] [2019-11-16 00:26:46,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:46,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:46,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:46,968 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-11-16 00:26:47,113 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-11-16 00:26:47,242 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-11-16 00:26:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:47,847 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-16 00:26:48,026 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-11-16 00:26:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:26:48,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851699644] [2019-11-16 00:26:48,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498166240] [2019-11-16 00:26:48,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:48,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-16 00:26:48,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:48,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:48,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:26:48,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:48,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:48,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:48,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2019-11-16 00:26:51,042 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~x~0.offset_BEFORE_CALL_39 Int) (v_main_~x~0.base_BEFORE_CALL_41 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_main_~x~0.base_BEFORE_CALL_41) (+ v_main_~x~0.offset_BEFORE_CALL_39 4)))) (and (<= (+ v_main_~x~0.base_BEFORE_CALL_41 2) .cse0) (<= v_main_~x~0.offset_BEFORE_CALL_39 0) (not (= 0 .cse0))))) is different from true [2019-11-16 00:26:52,202 WARN L860 $PredicateComparison]: unable to prove that (exists ((|remove_#t~mem4.offset| Int) (|remove_#t~mem5.base| Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_remove_#in~x.base|) (+ |c_remove_#in~x.offset| 4)))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) |remove_#t~mem4.offset| |remove_#t~mem5.base|))))) is different from true [2019-11-16 00:26:52,241 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:52,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 59 [2019-11-16 00:26:52,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:26:52,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:52,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:52,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-16 00:26:52,279 INFO L567 ElimStorePlain]: treesize reduction 96, result has 28.9 percent of original size [2019-11-16 00:26:52,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:52,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:25 [2019-11-16 00:26:54,283 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~x~0.base_BEFORE_CALL_43 Int) (v_main_~x~0.offset_BEFORE_CALL_41 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| v_main_~x~0.base_BEFORE_CALL_43) (+ v_main_~x~0.offset_BEFORE_CALL_41 4)))) (and (not (= 0 .cse0)) (<= (+ v_main_~x~0.base_BEFORE_CALL_43 2) .cse0) (<= v_main_~x~0.offset_BEFORE_CALL_41 0)))) is different from true [2019-11-16 00:26:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:54,535 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:54,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18] total 39 [2019-11-16 00:26:54,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639092378] [2019-11-16 00:26:54,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-16 00:26:54,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:54,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-16 00:26:54,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1150, Unknown=3, NotChecked=210, Total=1482 [2019-11-16 00:26:54,536 INFO L87 Difference]: Start difference. First operand 303 states and 347 transitions. Second operand 39 states. [2019-11-16 00:26:55,883 WARN L191 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-16 00:27:07,992 WARN L191 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-16 00:27:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:13,464 INFO L93 Difference]: Finished difference Result 315 states and 356 transitions. [2019-11-16 00:27:13,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-16 00:27:13,465 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 62 [2019-11-16 00:27:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:13,466 INFO L225 Difference]: With dead ends: 315 [2019-11-16 00:27:13,467 INFO L226 Difference]: Without dead ends: 311 [2019-11-16 00:27:13,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=333, Invalid=2860, Unknown=11, NotChecked=336, Total=3540 [2019-11-16 00:27:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-11-16 00:27:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 302. [2019-11-16 00:27:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-11-16 00:27:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 346 transitions. [2019-11-16 00:27:13,475 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 346 transitions. Word has length 62 [2019-11-16 00:27:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:13,476 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 346 transitions. [2019-11-16 00:27:13,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-16 00:27:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 346 transitions. [2019-11-16 00:27:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:27:13,477 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:13,477 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:13,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:13,682 INFO L410 AbstractCegarLoop]: === Iteration 45 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:27:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1139617815, now seen corresponding path program 1 times [2019-11-16 00:27:13,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:13,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161511705] [2019-11-16 00:27:13,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:13,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:13,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:27:14,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161511705] [2019-11-16 00:27:14,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821467382] [2019-11-16 00:27:14,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:14,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-16 00:27:14,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:14,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:27:14,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:14,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-11-16 00:27:14,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:14,699 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 21 treesize of output 20 [2019-11-16 00:27:14,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:14,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-11-16 00:27:14,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:14,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:14,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-16 00:27:14,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:14,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-11-16 00:27:14,898 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:14,898 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 17 treesize of output 21 [2019-11-16 00:27:14,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:14,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:69 [2019-11-16 00:27:14,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:15,036 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:15,036 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 6 case distinctions, treesize of input 70 treesize of output 168 [2019-11-16 00:27:15,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:15,102 INFO L567 ElimStorePlain]: treesize reduction 104, result has 37.3 percent of original size [2019-11-16 00:27:15,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:15,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:62 [2019-11-16 00:27:15,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:15,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:15,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:15,232 INFO L341 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-11-16 00:27:15,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 107 [2019-11-16 00:27:15,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:15,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:15,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:15,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2019-11-16 00:27:15,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:15,368 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-16 00:27:15,368 INFO L567 ElimStorePlain]: treesize reduction 26, result has 83.0 percent of original size [2019-11-16 00:27:15,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:15,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-16 00:27:15,369 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:127 [2019-11-16 00:27:15,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:15,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:15,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:15,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:15,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:15,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2019-11-16 00:27:15,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:15,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:15,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:15,661 INFO L341 Elim1Store]: treesize reduction 10, result has 91.6 percent of original size [2019-11-16 00:27:15,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 168 [2019-11-16 00:27:15,662 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:15,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:15,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:15,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2019-11-16 00:27:15,698 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:15,969 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-11-16 00:27:15,969 INFO L567 ElimStorePlain]: treesize reduction 96, result has 62.5 percent of original size [2019-11-16 00:27:15,970 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 3 xjuncts. [2019-11-16 00:27:15,970 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:203, output treesize:169 [2019-11-16 00:27:16,265 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-16 00:27:16,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:16,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:16,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:16,443 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:16,709 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-11-16 00:27:16,709 INFO L341 Elim1Store]: treesize reduction 10, result has 95.6 percent of original size [2019-11-16 00:27:16,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 87 treesize of output 275 [2019-11-16 00:27:16,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:16,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:16,911 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:16,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:16,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:16,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:16,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:16,947 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:17,024 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:17,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 143 [2019-11-16 00:27:17,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:17,340 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 55 [2019-11-16 00:27:17,340 INFO L567 ElimStorePlain]: treesize reduction 236, result has 39.8 percent of original size [2019-11-16 00:27:17,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:17,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:17,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-16 00:27:17,342 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:153, output treesize:156 [2019-11-16 00:27:17,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:17,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:17,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:17,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:17,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:17,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:17,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:17,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:17,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:17,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:17,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:17,655 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:17,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 190 [2019-11-16 00:27:17,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:17,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:17,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:17,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:17,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:17,721 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:17,740 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:17,808 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:17,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 199 [2019-11-16 00:27:17,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:17,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:17,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:17,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:17,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:17,910 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:17,939 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:18,116 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-16 00:27:18,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:18,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 349 [2019-11-16 00:27:18,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:18,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:18,352 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:18,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:18,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:18,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:18,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:18,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 86 [2019-11-16 00:27:18,433 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:18,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:18,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:18,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:18,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:18,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:18,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:18,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 155 [2019-11-16 00:27:18,545 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:19,445 WARN L191 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 93 [2019-11-16 00:27:19,446 INFO L567 ElimStorePlain]: treesize reduction 436, result has 49.4 percent of original size [2019-11-16 00:27:19,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-11-16 00:27:19,450 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:416, output treesize:440 [2019-11-16 00:27:19,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,903 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 71 [2019-11-16 00:27:19,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:19,917 INFO L392 ElimStorePlain]: Different costs {56=[v_prenex_57], 110=[|v_#memory_$Pointer$.base_88|]} [2019-11-16 00:27:19,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:19,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:19,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:19,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:19,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:19,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:19,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:19,994 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:19,995 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:20,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:20,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 109 treesize of output 94 [2019-11-16 00:27:20,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:20,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:20,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:20,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:20,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:20,083 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:20,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:20,258 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-16 00:27:20,258 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:20,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 112 treesize of output 340 [2019-11-16 00:27:20,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:20,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:20,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:20,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:20,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:20,265 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:20,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:20,277 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:20,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:20,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:20,299 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:20,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 100 [2019-11-16 00:27:20,300 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:21,100 WARN L191 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 105 [2019-11-16 00:27:21,100 INFO L567 ElimStorePlain]: treesize reduction 1124, result has 31.7 percent of original size [2019-11-16 00:27:21,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:21,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:21,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:21,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:21,124 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:21,570 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 103 [2019-11-16 00:27:21,571 INFO L341 Elim1Store]: treesize reduction 122, result has 73.7 percent of original size [2019-11-16 00:27:21,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 26 case distinctions, treesize of input 134 treesize of output 396 [2019-11-16 00:27:21,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:21,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:21,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,137 INFO L496 ElimStorePlain]: Start of recursive call 5: 11 dim-0 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:22,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:22,203 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:22,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:22,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:22,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:22,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:22,220 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:27:22,703 WARN L191 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-11-16 00:27:22,703 INFO L341 Elim1Store]: treesize reduction 142, result has 51.4 percent of original size [2019-11-16 00:27:22,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 143 treesize of output 202 [2019-11-16 00:27:22,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:22,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:22,750 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:27:26,827 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 492 DAG size of output: 254 [2019-11-16 00:27:26,828 INFO L567 ElimStorePlain]: treesize reduction 12051, result has 12.9 percent of original size [2019-11-16 00:27:26,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:27:26,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:26,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:26,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:26,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:26,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 49 dim-0 vars, and 5 xjuncts. [2019-11-16 00:27:27,008 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:606, output treesize:2250 [2019-11-16 00:27:27,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:27,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,326 WARN L191 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 511 DAG size of output: 175 [2019-11-16 00:27:34,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:34,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:27:34,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:34,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:15,710 WARN L191 SmtUtils]: Spent 38.80 s on a formula simplification. DAG size of input: 240 DAG size of output: 158 [2019-11-16 00:28:25,375 WARN L191 SmtUtils]: Spent 8.17 s on a formula simplification that was a NOOP. DAG size: 251 [2019-11-16 00:28:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:28:31,019 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:28:31,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2019-11-16 00:28:31,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174073565] [2019-11-16 00:28:31,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-16 00:28:31,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:31,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-16 00:28:31,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1588, Unknown=17, NotChecked=0, Total=1722 [2019-11-16 00:28:31,020 INFO L87 Difference]: Start difference. First operand 302 states and 346 transitions. Second operand 42 states. [2019-11-16 00:28:32,427 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-11-16 00:28:33,395 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 49 [2019-11-16 00:28:33,900 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 65 [2019-11-16 00:28:34,367 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 63 [2019-11-16 00:28:53,217 WARN L191 SmtUtils]: Spent 18.66 s on a formula simplification. DAG size of input: 243 DAG size of output: 138 [2019-11-16 00:29:10,155 WARN L191 SmtUtils]: Spent 16.70 s on a formula simplification. DAG size of input: 235 DAG size of output: 142 [2019-11-16 00:29:24,633 WARN L191 SmtUtils]: Spent 14.35 s on a formula simplification. DAG size of input: 243 DAG size of output: 213 [2019-11-16 00:29:25,015 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2019-11-16 00:29:25,581 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 283 [2019-11-16 00:29:31,124 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-11-16 00:29:31,798 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 87 [2019-11-16 00:29:32,510 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2019-11-16 00:29:32,895 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 278 [2019-11-16 00:29:34,267 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2019-11-16 00:29:34,914 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2019-11-16 00:29:37,859 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2019-11-16 00:29:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:41,607 INFO L93 Difference]: Finished difference Result 314 states and 354 transitions. [2019-11-16 00:29:41,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-16 00:29:41,608 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 63 [2019-11-16 00:29:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:29:41,609 INFO L225 Difference]: With dead ends: 314 [2019-11-16 00:29:41,609 INFO L226 Difference]: Without dead ends: 310 [2019-11-16 00:29:41,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 121.4s TimeCoverageRelationStatistics Valid=675, Invalid=4858, Unknown=17, NotChecked=0, Total=5550 [2019-11-16 00:29:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-16 00:29:41,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 243. [2019-11-16 00:29:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-16 00:29:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 272 transitions. [2019-11-16 00:29:41,614 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 272 transitions. Word has length 63 [2019-11-16 00:29:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:29:41,614 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 272 transitions. [2019-11-16 00:29:41,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-16 00:29:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 272 transitions. [2019-11-16 00:29:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:29:41,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:29:41,616 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:41,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:29:41,820 INFO L410 AbstractCegarLoop]: === Iteration 46 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:29:41,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:41,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1669777270, now seen corresponding path program 1 times [2019-11-16 00:29:41,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:29:41,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417573820] [2019-11-16 00:29:41,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:41,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:29:41,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:29:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:29:42,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417573820] [2019-11-16 00:29:42,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551930084] [2019-11-16 00:29:42,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:29:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:42,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-16 00:29:42,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:42,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:29:42,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:42,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:42,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:42,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:29:42,977 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_61|], 2=[|v_#memory_$Pointer$.base_90|]} [2019-11-16 00:29:42,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:29:42,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:42,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:42,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:42,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-16 00:29:42,997 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:43,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:43,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:43,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2019-11-16 00:29:43,056 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_62|], 6=[|v_#memory_$Pointer$.base_91|]} [2019-11-16 00:29:43,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:43,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-11-16 00:29:43,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:43,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:43,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:43,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:43,101 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 53 treesize of output 108 [2019-11-16 00:29:43,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:43,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:29:43,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:29:43,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:43,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:43,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:29:43,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:43,104 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:43,177 INFO L567 ElimStorePlain]: treesize reduction 397, result has 13.3 percent of original size [2019-11-16 00:29:43,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:29:43,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:60 [2019-11-16 00:29:45,094 WARN L860 $PredicateComparison]: unable to prove that (exists ((|remove_#t~mem8.offset| Int) (|remove_#t~mem7.offset| Int) (|remove_#t~mem8.base| Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_remove_#in~x.base|) |c_remove_#in~x.offset|)) (.cse1 (+ |remove_#t~mem7.offset| 4))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 |remove_#t~mem8.base|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 |remove_#t~mem8.offset|)))))) is different from true [2019-11-16 00:29:45,097 INFO L392 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_11|], 12=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_11|]} [2019-11-16 00:29:45,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:45,133 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:45,133 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 44 treesize of output 72 [2019-11-16 00:29:45,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:45,197 INFO L567 ElimStorePlain]: treesize reduction 22, result has 82.3 percent of original size [2019-11-16 00:29:45,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:45,279 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:45,279 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 193 [2019-11-16 00:29:45,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:29:45,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:29:45,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:29:45,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:29:45,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:29:45,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:29:45,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:29:45,303 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 6 xjuncts. [2019-11-16 00:29:45,595 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2019-11-16 00:29:45,595 INFO L567 ElimStorePlain]: treesize reduction 4285, result has 3.2 percent of original size [2019-11-16 00:29:45,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:29:45,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:102, output treesize:81 [2019-11-16 00:29:45,957 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-11-16 00:29:45,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-16 00:29:45,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:45,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:45,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:45,972 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:45,972 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 1 case distinctions, treesize of input 28 treesize of output 12 [2019-11-16 00:29:45,972 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:45,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:45,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:45,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:7 [2019-11-16 00:29:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:29:46,029 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:29:46,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 38 [2019-11-16 00:29:46,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009147189] [2019-11-16 00:29:46,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-16 00:29:46,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:29:46,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-16 00:29:46,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1227, Unknown=1, NotChecked=70, Total=1406 [2019-11-16 00:29:46,030 INFO L87 Difference]: Start difference. First operand 243 states and 272 transitions. Second operand 38 states. [2019-11-16 00:29:46,889 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2019-11-16 00:29:47,707 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2019-11-16 00:30:01,175 WARN L191 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2019-11-16 00:30:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:16,577 INFO L93 Difference]: Finished difference Result 301 states and 342 transitions. [2019-11-16 00:30:16,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-16 00:30:16,577 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 65 [2019-11-16 00:30:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:16,578 INFO L225 Difference]: With dead ends: 301 [2019-11-16 00:30:16,578 INFO L226 Difference]: Without dead ends: 301 [2019-11-16 00:30:16,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=740, Invalid=5252, Unknown=18, NotChecked=152, Total=6162 [2019-11-16 00:30:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-16 00:30:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 262. [2019-11-16 00:30:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-16 00:30:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 293 transitions. [2019-11-16 00:30:16,595 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 293 transitions. Word has length 65 [2019-11-16 00:30:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:16,595 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 293 transitions. [2019-11-16 00:30:16,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-16 00:30:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 293 transitions. [2019-11-16 00:30:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:16,596 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:16,597 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:16,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:30:16,800 INFO L410 AbstractCegarLoop]: === Iteration 47 === [re_insertErr1REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr4REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION]=== [2019-11-16 00:30:16,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:16,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1379090499, now seen corresponding path program 1 times [2019-11-16 00:30:16,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:16,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776888951] [2019-11-16 00:30:16,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:16,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:16,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:16,860 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:30:16,860 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:30:16,883 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-16 00:30:16,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:30:16 BoogieIcfgContainer [2019-11-16 00:30:16,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:30:16,903 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:30:16,903 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:30:16,903 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:30:16,904 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:23:13" (3/4) ... [2019-11-16 00:30:16,906 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:30:16,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:30:16,908 INFO L168 Benchmark]: Toolchain (without parser) took 425230.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 244.3 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -268.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:30:16,908 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:30:16,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:16,908 INFO L168 Benchmark]: Boogie Preprocessor took 59.34 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:16,909 INFO L168 Benchmark]: RCFGBuilder took 786.93 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:16,909 INFO L168 Benchmark]: TraceAbstraction took 423727.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 108.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -161.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:30:16,909 INFO L168 Benchmark]: Witness Printer took 4.05 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. [2019-11-16 00:30:16,910 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 644.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.34 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 786.93 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 423727.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 108.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -161.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.05 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 587]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 587. Possible FailurePath: [L589] struct node list; VAL [list={-3:0}] [L590] list.L=0 VAL [list={-3:0}] [L591] list.R=0 VAL [list={-3:0}] [L592] struct node *x=&list, *tail=&list; VAL [list={-3:0}, tail={-3:0}, x={-3:0}] [L593] COND TRUE __VERIFIER_nondet_bool() [L595] struct node *n=malloc(sizeof(struct node)); VAL [list={-3:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] [L596] COND FALSE !(n==0) VAL [list={-3:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] [L598] n->L=tail VAL [list={-3:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] [L599] n->R=0 VAL [list={-3:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] [L600] tail->R=n VAL [list={-3:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] [L601] COND FALSE !(__VERIFIER_nondet_bool()) [L593] COND FALSE !(__VERIFIER_nondet_bool()) [L604] CALL is_list_containing_x(&list, x) VAL [l={-3:0}, x={-3:0}] [L581] COND TRUE l==x [L582] return 1; VAL [\result=1, l={-3:0}, l={-3:0}, x={-3:0}, x={-3:0}] [L604] RET is_list_containing_x(&list, x) VAL [is_list_containing_x(&list, x)=1, list={-3:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] [L605] CALL remove(x) VAL [x={-3:0}] [L567] x->R VAL [x={-3:0}, x={-3:0}, x->R={-1:0}] [L567] COND TRUE x->R [L568] EXPR x->R VAL [x={-3:0}, x={-3:0}, x->R={-1:0}] [L568] EXPR x->L VAL [x={-3:0}, x={-3:0}, x->L={0:0}, x->R={-1:0}] [L568] x->R->L=x->L VAL [x={-3:0}, x={-3:0}, x->L={0:0}, x->R={-1:0}] [L569] x->L VAL [x={-3:0}, x={-3:0}, x->L={0:0}] [L569] COND FALSE !(x->L) [L605] RET remove(x) VAL [list={-3:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] [L606] EXPR &list==x || !is_list_containing_x(&list, x) VAL [&list==x || !is_list_containing_x(&list, x)=1, list={-3:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] [L606] CALL __VERIFIER_assert(&list==x || !is_list_containing_x(&list, x)) VAL [\old(cond)=1] [L5] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L606] RET __VERIFIER_assert(&list==x || !is_list_containing_x(&list, x)) VAL [&list==x || !is_list_containing_x(&list, x)=1, list={-3:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] [L607] CALL re_insert(x) VAL [x={-3:0}] [L574] x->R VAL [x={-3:0}, x={-3:0}, x->R={-1:0}] [L574] COND TRUE x->R [L575] EXPR x->R VAL [x={-3:0}, x={-3:0}, x->R={-1:0}] [L575] x->R->L=x VAL [x={-3:0}, x={-3:0}, x->R={-1:0}] [L576] x->L VAL [x={-3:0}, x={-3:0}, x->L={0:0}] [L576] COND FALSE !(x->L) [L607] RET re_insert(x) VAL [list={-3:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] [L608] CALL, EXPR is_list_containing_x(&list, x) VAL [l={-3:0}, x={-3:0}] [L581] COND TRUE l==x [L582] return 1; VAL [\result=1, l={-3:0}, l={-3:0}, x={-3:0}, x={-3:0}] [L608] RET, EXPR is_list_containing_x(&list, x) VAL [is_list_containing_x(&list, x)=1, list={-3:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] [L608] CALL __VERIFIER_assert(is_list_containing_x(&list, x)) VAL [\old(cond)=1] [L5] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L608] RET __VERIFIER_assert(is_list_containing_x(&list, x)) VAL [is_list_containing_x(&list, x)=1, list={-3:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] [L609] return 0; [L609] return 0; VAL [\result=0, malloc(sizeof(struct node))={-1:0}, n={-1:0}, tail={-3:0}, x={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 123 locations, 43 error locations. Result: UNSAFE, OverallTime: 423.6s, OverallIterations: 47, TraceHistogramMax: 4, AutomataDifference: 284.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3839 SDtfs, 10764 SDslu, 12069 SDs, 0 SdLazy, 67311 SolverSat, 6983 SolverUnsat, 52 SolverUnknown, 0 SolverNotchecked, 121.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2462 GetRequests, 977 SyntacticMatches, 90 SemanticMatches, 1395 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 16739 ImplicationChecksByTransitivity, 260.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=426occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 46 MinimizatonAttempts, 1549 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 128.3s InterpolantComputationTime, 2689 NumberOfCodeBlocks, 2689 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 2553 ConstructedInterpolants, 337 QuantifiedInterpolants, 2949466 SizeOfPredicates, 388 NumberOfNonLiveVariables, 5245 ConjunctsInSsa, 951 ConjunctsInUnsatCore, 71 InterpolantComputations, 21 PerfectInterpolantSequences, 247/423 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:30:19,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:30:19,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:30:19,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:30:19,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:30:19,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:30:19,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:30:19,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:30:19,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:30:19,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:30:19,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:30:19,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:30:19,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:30:19,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:30:19,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:30:19,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:30:19,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:30:19,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:30:19,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:30:19,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:30:19,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:30:19,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:30:19,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:30:19,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:30:19,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:30:19,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:30:19,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:30:19,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:30:19,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:30:19,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:30:19,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:30:19,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:30:19,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:30:19,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:30:19,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:30:19,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:30:19,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:30:19,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:30:19,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:30:19,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:30:19,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:30:19,052 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-16 00:30:19,068 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:30:19,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:30:19,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:30:19,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:30:19,074 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:30:19,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:30:19,074 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:30:19,074 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:30:19,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:30:19,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:30:19,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:30:19,075 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:30:19,075 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:30:19,075 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:30:19,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:30:19,075 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:30:19,075 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:30:19,075 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:30:19,075 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:30:19,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:30:19,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:30:19,076 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:30:19,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:30:19,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:30:19,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:30:19,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:30:19,077 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:30:19,077 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:30:19,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:30:19,078 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_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/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 -> 63ea7ed840682b4e196bd141458679e7836ad115 [2019-11-16 00:30:19,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:30:19,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:30:19,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:30:19,141 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:30:19,142 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:30:19,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/../../sv-benchmarks/c/heap-manipulation/dancing.i [2019-11-16 00:30:19,200 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/data/f5a3720d7/ec0b9f65047b45daad9a67ec72f40e9a/FLAG61bbc16b2 [2019-11-16 00:30:19,682 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:30:19,683 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/sv-benchmarks/c/heap-manipulation/dancing.i [2019-11-16 00:30:19,700 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/data/f5a3720d7/ec0b9f65047b45daad9a67ec72f40e9a/FLAG61bbc16b2 [2019-11-16 00:30:19,983 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/data/f5a3720d7/ec0b9f65047b45daad9a67ec72f40e9a [2019-11-16 00:30:19,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:30:19,986 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:30:19,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:30:19,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:30:19,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:30:19,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:19" (1/1) ... [2019-11-16 00:30:19,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408dc90a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:19, skipping insertion in model container [2019-11-16 00:30:19,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:19" (1/1) ... [2019-11-16 00:30:20,000 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:30:20,048 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:30:20,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:30:20,395 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:30:20,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:30:20,542 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:30:20,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20 WrapperNode [2019-11-16 00:30:20,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:30:20,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:30:20,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:30:20,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:30:20,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2019-11-16 00:30:20,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2019-11-16 00:30:20,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2019-11-16 00:30:20,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2019-11-16 00:30:20,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2019-11-16 00:30:20,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2019-11-16 00:30:20,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2019-11-16 00:30:20,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:30:20,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:30:20,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:30:20,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:30:20,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:30:20,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:30:20,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:30:20,670 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-16 00:30:20,670 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:30:20,670 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:30:20,670 INFO L138 BoogieDeclarations]: Found implementation of procedure remove [2019-11-16 00:30:20,670 INFO L138 BoogieDeclarations]: Found implementation of procedure re_insert [2019-11-16 00:30:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2019-11-16 00:30:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:30:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-16 00:30:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-16 00:30:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:30:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-16 00:30:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:30:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:30:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:30:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:30:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:30:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:30:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:30:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:30:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:30:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:30:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:30:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:30:20,673 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:30:20,674 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:30:20,674 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:30:20,674 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:30:20,674 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:30:20,674 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:30:20,674 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:30:20,674 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:30:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:30:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:30:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:30:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:30:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:30:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:30:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:30:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:30:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:30:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:30:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:30:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:30:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:30:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:30:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:30:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:30:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:30:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:30:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:30:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:30:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:30:20,676 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:30:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:30:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:30:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:30:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:30:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:30:20,677 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:30:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:30:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:30:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:30:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:30:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:30:20,678 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:30:20,679 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:30:20,679 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:30:20,679 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:30:20,679 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:30:20,679 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:30:20,679 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:30:20,680 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:30:20,680 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:30:20,680 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:30:20,680 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:30:20,680 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:30:20,680 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:30:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:30:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:30:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:30:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:30:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:30:20,681 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:30:20,682 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:30:20,682 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:30:20,682 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:30:20,682 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:30:20,682 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:30:20,682 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:30:20,683 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:30:20,683 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:30:20,683 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:30:20,683 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:30:20,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:30:20,684 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:30:20,684 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:30:20,684 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:30:20,684 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:30:20,684 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:30:20,684 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:30:20,685 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:30:20,685 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:30:20,685 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:30:20,685 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:30:20,685 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:30:20,685 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:30:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:30:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:30:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:30:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:30:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:30:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:30:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:30:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2019-11-16 00:30:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:30:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:30:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure re_insert [2019-11-16 00:30:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2019-11-16 00:30:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:30:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:30:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:30:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:30:20,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:30:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:30:21,537 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:30:21,538 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-16 00:30:21,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:21 BoogieIcfgContainer [2019-11-16 00:30:21,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:30:21,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:30:21,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:30:21,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:30:21,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:30:19" (1/3) ... [2019-11-16 00:30:21,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12938f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:21, skipping insertion in model container [2019-11-16 00:30:21,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (2/3) ... [2019-11-16 00:30:21,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12938f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:21, skipping insertion in model container [2019-11-16 00:30:21,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:21" (3/3) ... [2019-11-16 00:30:21,554 INFO L109 eAbstractionObserver]: Analyzing ICFG dancing.i [2019-11-16 00:30:21,563 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:30:21,572 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2019-11-16 00:30:21,582 INFO L249 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2019-11-16 00:30:21,608 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:30:21,609 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:30:21,609 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:30:21,609 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:30:21,609 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:30:21,610 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:30:21,610 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:30:21,610 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:30:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2019-11-16 00:30:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-16 00:30:21,635 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:21,636 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:21,638 INFO L410 AbstractCegarLoop]: === Iteration 1 === [re_insertErr4REQUIRES_VIOLATION, re_insertErr9REQUIRES_VIOLATION, re_insertErr8REQUIRES_VIOLATION, re_insertErr2REQUIRES_VIOLATION, re_insertErr3REQUIRES_VIOLATION, re_insertErr1REQUIRES_VIOLATION, re_insertErr7REQUIRES_VIOLATION, re_insertErr6REQUIRES_VIOLATION, re_insertErr11REQUIRES_VIOLATION, re_insertErr10REQUIRES_VIOLATION, re_insertErr0REQUIRES_VIOLATION, re_insertErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, removeErr12REQUIRES_VIOLATION, removeErr1REQUIRES_VIOLATION, removeErr0REQUIRES_VIOLATION, removeErr11REQUIRES_VIOLATION, removeErr10REQUIRES_VIOLATION, removeErr9REQUIRES_VIOLATION, removeErr8REQUIRES_VIOLATION, removeErr7REQUIRES_VIOLATION, removeErr6REQUIRES_VIOLATION, removeErr5REQUIRES_VIOLATION, removeErr4REQUIRES_VIOLATION, removeErr15REQUIRES_VIOLATION, removeErr14REQUIRES_VIOLATION, removeErr3REQUIRES_VIOLATION, removeErr2REQUIRES_VIOLATION, removeErr13REQUIRES_VIOLATION]=== [2019-11-16 00:30:21,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:21,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1095562270, now seen corresponding path program 1 times [2019-11-16 00:30:21,654 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:30:21,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [242644316] [2019-11-16 00:30:21,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a9d4c4-d3d8-4e77-a3fd-1a0dceb126cc/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:30:21,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:30:21,878 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:30:21,882 INFO L168 Benchmark]: Toolchain (without parser) took 1895.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 941.6 MB in the beginning and 1.0 GB in the end (delta: -105.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:21,883 INFO L168 Benchmark]: CDTParser took 0.77 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:30:21,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:21,884 INFO L168 Benchmark]: Boogie Preprocessor took 66.56 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:21,885 INFO L168 Benchmark]: RCFGBuilder took 929.88 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: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:21,886 INFO L168 Benchmark]: TraceAbstraction took 339.09 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.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:21,889 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.77 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 555.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.56 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 929.88 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: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 339.09 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.1 MB). Peak memory consumption was 13.1 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...