./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.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_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/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 04d17eda3d030bee53a60ea5a86a683be82674c1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:52:01,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:52:01,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:52:01,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:52:01,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:52:01,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:52:01,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:52:01,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:52:01,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:52:01,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:52:01,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:52:01,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:52:01,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:52:01,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:52:01,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:52:01,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:52:01,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:52:01,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:52:01,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:52:01,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:52:01,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:52:01,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:52:01,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:52:01,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:52:01,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:52:01,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:52:01,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:52:01,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:52:01,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:52:01,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:52:01,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:52:01,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:52:01,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:52:01,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:52:01,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:52:01,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:52:01,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:52:01,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:52:01,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:52:01,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:52:01,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:52:01,964 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 23:52:01,976 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:52:01,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:52:01,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:52:01,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:52:01,978 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:52:01,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:52:01,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:52:01,978 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:52:01,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:52:01,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:52:01,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:52:01,979 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:52:01,980 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:52:01,980 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:52:01,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:52:01,980 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:52:01,980 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:52:01,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:52:01,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:52:01,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:52:01,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:52:01,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:52:01,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:52:01,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:52:01,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:52:01,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:52:01,983 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_3520d13e-40e9-412b-afb8-75777fbc2f0c/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 -> 04d17eda3d030bee53a60ea5a86a683be82674c1 [2019-11-15 23:52:02,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:52:02,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:52:02,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:52:02,023 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:52:02,024 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:52:02,024 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2019-11-15 23:52:02,079 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/data/e3112fc6c/9bb6304a98f3448a92b2579394338871/FLAGcd62aacfb [2019-11-15 23:52:02,501 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:52:02,502 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2019-11-15 23:52:02,520 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/data/e3112fc6c/9bb6304a98f3448a92b2579394338871/FLAGcd62aacfb [2019-11-15 23:52:02,818 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/data/e3112fc6c/9bb6304a98f3448a92b2579394338871 [2019-11-15 23:52:02,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:52:02,821 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:52:02,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:02,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:52:02,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:52:02,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:02" (1/1) ... [2019-11-15 23:52:02,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8417b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:02, skipping insertion in model container [2019-11-15 23:52:02,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:02" (1/1) ... [2019-11-15 23:52:02,836 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:52:02,884 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:52:03,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:03,218 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:52:03,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:03,336 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:52:03,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:03 WrapperNode [2019-11-15 23:52:03,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:03,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:52:03,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:52:03,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:52:03,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:03" (1/1) ... [2019-11-15 23:52:03,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:03" (1/1) ... [2019-11-15 23:52:03,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:03" (1/1) ... [2019-11-15 23:52:03,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:03" (1/1) ... [2019-11-15 23:52:03,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:03" (1/1) ... [2019-11-15 23:52:03,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:03" (1/1) ... [2019-11-15 23:52:03,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:03" (1/1) ... [2019-11-15 23:52:03,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:52:03,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:52:03,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:52:03,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:52:03,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:52:03,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:52:03,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:52:03,471 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 23:52:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 23:52:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-15 23:52:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-15 23:52:03,473 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-11-15 23:52:03,473 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_last [2019-11-15 23:52:03,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:52:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:52:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 23:52:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 23:52:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:52:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:52:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:52:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:52:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:52:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:52:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:52:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:52:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:52:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:52:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:52:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:52:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:52:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:52:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:52:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:52:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:52:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:52:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:52:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:52:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:52:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:52:03,483 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:52:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:52:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:52:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:52:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:52:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:52:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:52:03,484 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:52:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:52:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:52:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:52:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:52:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:52:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:52:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:52:03,485 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:52:03,486 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:52:03,486 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:52:03,486 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:52:03,486 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:52:03,486 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:52:03,487 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:52:03,487 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:52:03,487 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:52:03,487 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:52:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:52:03,488 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:52:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:52:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:52:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:52:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:52:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:52:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:52:03,489 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:52:03,490 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:52:03,490 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:52:03,490 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:52:03,491 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:52:03,491 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:52:03,491 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:52:03,492 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:52:03,492 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:52:03,492 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:52:03,493 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:52:03,493 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:52:03,493 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:52:03,494 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:52:03,494 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:52:03,494 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:52:03,494 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:52:03,495 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:52:03,495 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:52:03,495 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:52:03,495 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:52:03,495 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:52:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:52:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:52:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:52:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:52:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:52:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:52:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:52:03,496 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:52:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:52:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:52:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:52:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:52:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:52:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:52:03,497 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:52:03,498 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:52:03,498 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:52:03,498 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:52:03,498 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:52:03,498 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:52:03,498 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:52:03,498 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:52:03,498 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:52:03,499 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:52:03,499 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:52:03,499 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:52:03,499 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-15 23:52:03,499 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-15 23:52:03,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:52:03,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:52:03,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:52:03,500 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-11-15 23:52:03,500 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_last [2019-11-15 23:52:03,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:52:03,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:52:03,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:52:03,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:52:03,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:52:03,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:52:03,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:52:03,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:52:03,908 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-15 23:52:04,239 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:52:04,240 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-15 23:52:04,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:04 BoogieIcfgContainer [2019-11-15 23:52:04,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:52:04,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:52:04,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:52:04,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:52:04,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:52:02" (1/3) ... [2019-11-15 23:52:04,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74be90ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:52:04, skipping insertion in model container [2019-11-15 23:52:04,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:03" (2/3) ... [2019-11-15 23:52:04,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74be90ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:52:04, skipping insertion in model container [2019-11-15 23:52:04,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:04" (3/3) ... [2019-11-15 23:52:04,248 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i [2019-11-15 23:52:04,256 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:52:04,263 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2019-11-15 23:52:04,272 INFO L249 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2019-11-15 23:52:04,289 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:52:04,289 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:52:04,289 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:52:04,289 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:52:04,290 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:52:04,290 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:52:04,290 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:52:04,290 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:52:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-11-15 23:52:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:52:04,315 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:04,315 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:04,317 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1896164257, now seen corresponding path program 1 times [2019-11-15 23:52:04,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:04,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3725039] [2019-11-15 23:52:04,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:04,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:04,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:04,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3725039] [2019-11-15 23:52:04,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:04,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:04,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689621669] [2019-11-15 23:52:04,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:04,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:04,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:04,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:04,538 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2019-11-15 23:52:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:04,806 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2019-11-15 23:52:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:04,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 23:52:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:04,817 INFO L225 Difference]: With dead ends: 88 [2019-11-15 23:52:04,817 INFO L226 Difference]: Without dead ends: 81 [2019-11-15 23:52:04,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-15 23:52:04,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2019-11-15 23:52:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 23:52:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-11-15 23:52:04,855 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 11 [2019-11-15 23:52:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:04,855 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-11-15 23:52:04,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-11-15 23:52:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 23:52:04,856 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:04,856 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:04,856 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:04,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:04,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1896164258, now seen corresponding path program 1 times [2019-11-15 23:52:04,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:04,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610766899] [2019-11-15 23:52:04,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:04,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:04,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:04,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610766899] [2019-11-15 23:52:04,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:04,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:04,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742962993] [2019-11-15 23:52:04,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:04,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:04,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:04,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:04,957 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 4 states. [2019-11-15 23:52:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:05,138 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-15 23:52:05,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:05,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-15 23:52:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:05,141 INFO L225 Difference]: With dead ends: 78 [2019-11-15 23:52:05,141 INFO L226 Difference]: Without dead ends: 78 [2019-11-15 23:52:05,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:05,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-15 23:52:05,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-11-15 23:52:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 23:52:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-11-15 23:52:05,151 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 11 [2019-11-15 23:52:05,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:05,151 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-11-15 23:52:05,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-11-15 23:52:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:52:05,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:05,153 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:05,153 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:05,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1912750276, now seen corresponding path program 1 times [2019-11-15 23:52:05,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:05,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622109160] [2019-11-15 23:52:05,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:05,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:05,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:05,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622109160] [2019-11-15 23:52:05,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:05,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:52:05,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377467550] [2019-11-15 23:52:05,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:52:05,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:05,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:52:05,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:52:05,276 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 6 states. [2019-11-15 23:52:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:05,584 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-11-15 23:52:05,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:52:05,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 23:52:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:05,590 INFO L225 Difference]: With dead ends: 81 [2019-11-15 23:52:05,590 INFO L226 Difference]: Without dead ends: 81 [2019-11-15 23:52:05,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-15 23:52:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2019-11-15 23:52:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-15 23:52:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-11-15 23:52:05,613 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 15 [2019-11-15 23:52:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:05,616 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-11-15 23:52:05,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:52:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-11-15 23:52:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:52:05,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:05,619 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:05,619 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:05,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:05,620 INFO L82 PathProgramCache]: Analyzing trace with hash -846837275, now seen corresponding path program 1 times [2019-11-15 23:52:05,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:05,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142369951] [2019-11-15 23:52:05,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:05,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:05,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:05,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142369951] [2019-11-15 23:52:05,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:05,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:52:05,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095129770] [2019-11-15 23:52:05,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:05,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:05,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:05,692 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 4 states. [2019-11-15 23:52:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:05,862 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-11-15 23:52:05,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:52:05,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-15 23:52:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:05,864 INFO L225 Difference]: With dead ends: 85 [2019-11-15 23:52:05,864 INFO L226 Difference]: Without dead ends: 85 [2019-11-15 23:52:05,864 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-15 23:52:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2019-11-15 23:52:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-15 23:52:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2019-11-15 23:52:05,871 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 15 [2019-11-15 23:52:05,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:05,872 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2019-11-15 23:52:05,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2019-11-15 23:52:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:52:05,873 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:05,873 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:05,874 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:05,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:05,874 INFO L82 PathProgramCache]: Analyzing trace with hash 93105528, now seen corresponding path program 1 times [2019-11-15 23:52:05,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:05,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052272992] [2019-11-15 23:52:05,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:05,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:05,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:06,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052272992] [2019-11-15 23:52:06,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:06,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:52:06,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13651314] [2019-11-15 23:52:06,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:52:06,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:06,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:52:06,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:06,007 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 8 states. [2019-11-15 23:52:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:06,483 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2019-11-15 23:52:06,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:52:06,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-15 23:52:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:06,486 INFO L225 Difference]: With dead ends: 122 [2019-11-15 23:52:06,486 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 23:52:06,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:52:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 23:52:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 87. [2019-11-15 23:52:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-15 23:52:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2019-11-15 23:52:06,506 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 17 [2019-11-15 23:52:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:06,506 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2019-11-15 23:52:06,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:52:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2019-11-15 23:52:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:52:06,508 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:06,508 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:06,509 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:06,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:06,509 INFO L82 PathProgramCache]: Analyzing trace with hash 93105529, now seen corresponding path program 1 times [2019-11-15 23:52:06,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:06,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701520617] [2019-11-15 23:52:06,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:06,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:06,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:06,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701520617] [2019-11-15 23:52:06,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:06,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:52:06,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746428895] [2019-11-15 23:52:06,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:52:06,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:52:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:52:06,654 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 7 states. [2019-11-15 23:52:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:06,953 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-11-15 23:52:06,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:52:06,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-15 23:52:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:06,954 INFO L225 Difference]: With dead ends: 83 [2019-11-15 23:52:06,954 INFO L226 Difference]: Without dead ends: 80 [2019-11-15 23:52:06,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:52:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-15 23:52:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-11-15 23:52:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-15 23:52:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-11-15 23:52:06,960 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 17 [2019-11-15 23:52:06,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:06,960 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-11-15 23:52:06,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:52:06,961 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-11-15 23:52:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:52:06,961 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:06,961 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:06,962 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:06,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:06,962 INFO L82 PathProgramCache]: Analyzing trace with hash -633949633, now seen corresponding path program 1 times [2019-11-15 23:52:06,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:06,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713536303] [2019-11-15 23:52:06,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:06,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:06,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:07,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:07,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713536303] [2019-11-15 23:52:07,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698289541] [2019-11-15 23:52:07,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:07,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:52:07,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:07,305 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:07,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 23:52:07,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:07,327 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 23:52:07,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:07,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 23:52:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:07,358 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:07,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-15 23:52:07,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313284481] [2019-11-15 23:52:07,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:52:07,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:07,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:52:07,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:52:07,359 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 7 states. [2019-11-15 23:52:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:07,580 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-11-15 23:52:07,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:52:07,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-15 23:52:07,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:07,582 INFO L225 Difference]: With dead ends: 79 [2019-11-15 23:52:07,582 INFO L226 Difference]: Without dead ends: 79 [2019-11-15 23:52:07,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:52:07,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-15 23:52:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-11-15 23:52:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-15 23:52:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-11-15 23:52:07,587 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 22 [2019-11-15 23:52:07,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:07,587 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-11-15 23:52:07,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:52:07,588 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-11-15 23:52:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:52:07,588 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:07,589 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:07,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:07,792 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:07,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash -633949632, now seen corresponding path program 1 times [2019-11-15 23:52:07,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:07,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581426513] [2019-11-15 23:52:07,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:07,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:07,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:07,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581426513] [2019-11-15 23:52:07,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060535628] [2019-11-15 23:52:07,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:08,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:52:08,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:08,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:52:08,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:08,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:08,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:08,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:52:08,123 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:08,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 23:52:08,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:08,144 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-15 23:52:08,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:08,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-15 23:52:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:08,156 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:08,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-15 23:52:08,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015751370] [2019-11-15 23:52:08,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:52:08,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:08,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:52:08,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:08,157 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 8 states. [2019-11-15 23:52:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:08,453 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-11-15 23:52:08,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:52:08,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-15 23:52:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:08,454 INFO L225 Difference]: With dead ends: 78 [2019-11-15 23:52:08,455 INFO L226 Difference]: Without dead ends: 78 [2019-11-15 23:52:08,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:52:08,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-15 23:52:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-11-15 23:52:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-15 23:52:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-11-15 23:52:08,460 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 22 [2019-11-15 23:52:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:08,460 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-11-15 23:52:08,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:52:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-11-15 23:52:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:52:08,461 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:08,461 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:08,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:08,665 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1480300718, now seen corresponding path program 1 times [2019-11-15 23:52:08,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:08,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002699112] [2019-11-15 23:52:08,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:08,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:08,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:08,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002699112] [2019-11-15 23:52:08,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146436663] [2019-11-15 23:52:08,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:08,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:52:08,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:08,918 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:08,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 23:52:08,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978743386] [2019-11-15 23:52:08,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:52:08,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:08,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:52:08,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:52:08,919 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 9 states. [2019-11-15 23:52:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:09,186 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-11-15 23:52:09,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:52:09,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-15 23:52:09,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:09,187 INFO L225 Difference]: With dead ends: 89 [2019-11-15 23:52:09,187 INFO L226 Difference]: Without dead ends: 86 [2019-11-15 23:52:09,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-15 23:52:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2019-11-15 23:52:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-15 23:52:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-11-15 23:52:09,192 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 24 [2019-11-15 23:52:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:09,192 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-11-15 23:52:09,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:52:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-11-15 23:52:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:52:09,194 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:09,194 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] [2019-11-15 23:52:09,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:09,401 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:09,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:09,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1730493384, now seen corresponding path program 2 times [2019-11-15 23:52:09,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:09,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719624515] [2019-11-15 23:52:09,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:09,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:09,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:09,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719624515] [2019-11-15 23:52:09,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081398548] [2019-11-15 23:52:09,497 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:09,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:52:09,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:52:09,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:52:09,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:09,655 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:09,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-15 23:52:09,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325276946] [2019-11-15 23:52:09,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:52:09,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:09,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:52:09,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:52:09,658 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 6 states. [2019-11-15 23:52:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:09,933 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-11-15 23:52:09,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:52:09,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-15 23:52:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:09,935 INFO L225 Difference]: With dead ends: 79 [2019-11-15 23:52:09,935 INFO L226 Difference]: Without dead ends: 79 [2019-11-15 23:52:09,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-15 23:52:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-15 23:52:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-15 23:52:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2019-11-15 23:52:09,940 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 31 [2019-11-15 23:52:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:09,940 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2019-11-15 23:52:09,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:52:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2019-11-15 23:52:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:52:09,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:09,942 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] [2019-11-15 23:52:10,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:10,145 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:10,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:10,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1285234114, now seen corresponding path program 1 times [2019-11-15 23:52:10,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:10,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350500487] [2019-11-15 23:52:10,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:10,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:10,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:10,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350500487] [2019-11-15 23:52:10,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292154788] [2019-11-15 23:52:10,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:10,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:52:10,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:10,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:52:10,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:10,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:10,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:10,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:52:10,562 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 5 treesize of output 3 [2019-11-15 23:52:10,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:10,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:10,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:10,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 23:52:10,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:10,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:10,693 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 23:52:10,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 23:52:10,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:10,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:10,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:10,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:26 [2019-11-15 23:52:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:10,823 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:10,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-15 23:52:10,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245008420] [2019-11-15 23:52:10,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:52:10,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:10,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:52:10,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:52:10,830 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 16 states. [2019-11-15 23:52:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:11,675 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-11-15 23:52:11,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:52:11,675 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-11-15 23:52:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:11,677 INFO L225 Difference]: With dead ends: 130 [2019-11-15 23:52:11,677 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 23:52:11,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:52:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 23:52:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2019-11-15 23:52:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-15 23:52:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2019-11-15 23:52:11,683 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 32 [2019-11-15 23:52:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:11,683 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2019-11-15 23:52:11,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:52:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2019-11-15 23:52:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:52:11,688 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:11,689 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] [2019-11-15 23:52:11,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:11,898 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:11,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1285234113, now seen corresponding path program 1 times [2019-11-15 23:52:11,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:11,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094407446] [2019-11-15 23:52:11,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:11,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:11,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:12,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094407446] [2019-11-15 23:52:12,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650325337] [2019-11-15 23:52:12,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:12,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 23:52:12,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:12,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 23:52:12,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:12,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:12,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:12,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:52:12,305 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 5 treesize of output 3 [2019-11-15 23:52:12,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:12,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:12,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:12,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-15 23:52:12,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:12,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:12,383 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 23:52:12,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-15 23:52:12,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:12,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:12,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:12,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:29 [2019-11-15 23:52:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:12,471 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:12,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-15 23:52:12,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120805617] [2019-11-15 23:52:12,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:52:12,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:12,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:52:12,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:52:12,472 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 16 states. [2019-11-15 23:52:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:13,360 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-11-15 23:52:13,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:52:13,361 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-11-15 23:52:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:13,362 INFO L225 Difference]: With dead ends: 138 [2019-11-15 23:52:13,362 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 23:52:13,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:52:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 23:52:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 120. [2019-11-15 23:52:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 23:52:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2019-11-15 23:52:13,368 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 32 [2019-11-15 23:52:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:13,369 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2019-11-15 23:52:13,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:52:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2019-11-15 23:52:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:52:13,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:13,370 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] [2019-11-15 23:52:13,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:13,576 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:13,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:13,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1187551869, now seen corresponding path program 1 times [2019-11-15 23:52:13,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:13,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351948515] [2019-11-15 23:52:13,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:13,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:13,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:13,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351948515] [2019-11-15 23:52:13,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:13,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:52:13,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598810859] [2019-11-15 23:52:13,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:52:13,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:13,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:52:13,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:13,789 INFO L87 Difference]: Start difference. First operand 120 states and 145 transitions. Second operand 12 states. [2019-11-15 23:52:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:14,449 INFO L93 Difference]: Finished difference Result 167 states and 208 transitions. [2019-11-15 23:52:14,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:52:14,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-15 23:52:14,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:14,454 INFO L225 Difference]: With dead ends: 167 [2019-11-15 23:52:14,454 INFO L226 Difference]: Without dead ends: 167 [2019-11-15 23:52:14,454 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:52:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-15 23:52:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 125. [2019-11-15 23:52:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 23:52:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2019-11-15 23:52:14,459 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 33 [2019-11-15 23:52:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:14,459 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2019-11-15 23:52:14,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:52:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2019-11-15 23:52:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:52:14,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:14,464 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] [2019-11-15 23:52:14,465 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1187551870, now seen corresponding path program 1 times [2019-11-15 23:52:14,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:14,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754358282] [2019-11-15 23:52:14,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:14,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:14,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:52:14,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754358282] [2019-11-15 23:52:14,627 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:14,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:52:14,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566770893] [2019-11-15 23:52:14,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:52:14,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:14,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:52:14,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:14,629 INFO L87 Difference]: Start difference. First operand 125 states and 155 transitions. Second operand 12 states. [2019-11-15 23:52:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:15,332 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2019-11-15 23:52:15,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:52:15,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-15 23:52:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:15,335 INFO L225 Difference]: With dead ends: 162 [2019-11-15 23:52:15,335 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 23:52:15,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:52:15,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 23:52:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 125. [2019-11-15 23:52:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 23:52:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2019-11-15 23:52:15,340 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 33 [2019-11-15 23:52:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:15,341 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2019-11-15 23:52:15,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:52:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2019-11-15 23:52:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:52:15,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:15,342 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] [2019-11-15 23:52:15,343 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:15,343 INFO L82 PathProgramCache]: Analyzing trace with hash -712137019, now seen corresponding path program 1 times [2019-11-15 23:52:15,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:15,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126430497] [2019-11-15 23:52:15,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:15,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:15,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:15,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126430497] [2019-11-15 23:52:15,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:15,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:52:15,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997628098] [2019-11-15 23:52:15,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:52:15,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:15,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:52:15,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:15,509 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand 12 states. [2019-11-15 23:52:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:16,107 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2019-11-15 23:52:16,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:52:16,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-15 23:52:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:16,109 INFO L225 Difference]: With dead ends: 124 [2019-11-15 23:52:16,109 INFO L226 Difference]: Without dead ends: 124 [2019-11-15 23:52:16,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:52:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-15 23:52:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-11-15 23:52:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 23:52:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2019-11-15 23:52:16,112 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 36 [2019-11-15 23:52:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:16,113 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2019-11-15 23:52:16,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:52:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2019-11-15 23:52:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:52:16,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:16,114 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] [2019-11-15 23:52:16,114 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:16,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:16,115 INFO L82 PathProgramCache]: Analyzing trace with hash -600980088, now seen corresponding path program 1 times [2019-11-15 23:52:16,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:16,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799356209] [2019-11-15 23:52:16,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:16,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799356209] [2019-11-15 23:52:16,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:16,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:52:16,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343798689] [2019-11-15 23:52:16,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:52:16,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:16,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:52:16,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:16,206 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand 8 states. [2019-11-15 23:52:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:16,566 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2019-11-15 23:52:16,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:52:16,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-11-15 23:52:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:16,568 INFO L225 Difference]: With dead ends: 125 [2019-11-15 23:52:16,568 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 23:52:16,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:52:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 23:52:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-11-15 23:52:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 23:52:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2019-11-15 23:52:16,573 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 37 [2019-11-15 23:52:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:16,573 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2019-11-15 23:52:16,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:52:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2019-11-15 23:52:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:52:16,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:16,574 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] [2019-11-15 23:52:16,574 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:16,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:16,574 INFO L82 PathProgramCache]: Analyzing trace with hash -600980087, now seen corresponding path program 1 times [2019-11-15 23:52:16,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:16,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844018825] [2019-11-15 23:52:16,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:16,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:16,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844018825] [2019-11-15 23:52:16,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:16,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 23:52:16,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320774073] [2019-11-15 23:52:16,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:52:16,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:52:16,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:52:16,840 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand 14 states. [2019-11-15 23:52:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:17,770 INFO L93 Difference]: Finished difference Result 186 states and 228 transitions. [2019-11-15 23:52:17,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:52:17,770 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-11-15 23:52:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:17,772 INFO L225 Difference]: With dead ends: 186 [2019-11-15 23:52:17,772 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 23:52:17,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-11-15 23:52:17,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 23:52:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 148. [2019-11-15 23:52:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-15 23:52:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 186 transitions. [2019-11-15 23:52:17,779 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 186 transitions. Word has length 37 [2019-11-15 23:52:17,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:17,780 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 186 transitions. [2019-11-15 23:52:17,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:52:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 186 transitions. [2019-11-15 23:52:17,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:52:17,780 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:17,781 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] [2019-11-15 23:52:17,781 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:17,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:17,781 INFO L82 PathProgramCache]: Analyzing trace with hash -601411037, now seen corresponding path program 1 times [2019-11-15 23:52:17,781 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:17,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502240249] [2019-11-15 23:52:17,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:17,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:17,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:17,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502240249] [2019-11-15 23:52:17,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:17,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:52:17,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877064457] [2019-11-15 23:52:17,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:52:17,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:17,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:52:17,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:17,954 INFO L87 Difference]: Start difference. First operand 148 states and 186 transitions. Second operand 12 states. [2019-11-15 23:52:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:18,502 INFO L93 Difference]: Finished difference Result 180 states and 224 transitions. [2019-11-15 23:52:18,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:52:18,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-11-15 23:52:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:18,504 INFO L225 Difference]: With dead ends: 180 [2019-11-15 23:52:18,504 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 23:52:18,504 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:52:18,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 23:52:18,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 154. [2019-11-15 23:52:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-15 23:52:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 193 transitions. [2019-11-15 23:52:18,510 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 193 transitions. Word has length 37 [2019-11-15 23:52:18,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:18,510 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 193 transitions. [2019-11-15 23:52:18,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:52:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 193 transitions. [2019-11-15 23:52:18,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 23:52:18,511 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:18,511 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] [2019-11-15 23:52:18,512 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:18,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:18,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1463872889, now seen corresponding path program 1 times [2019-11-15 23:52:18,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:18,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335979557] [2019-11-15 23:52:18,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:18,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:18,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:18,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335979557] [2019-11-15 23:52:18,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:18,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:52:18,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469689103] [2019-11-15 23:52:18,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:52:18,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:18,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:52:18,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:52:18,592 INFO L87 Difference]: Start difference. First operand 154 states and 193 transitions. Second operand 7 states. [2019-11-15 23:52:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:18,838 INFO L93 Difference]: Finished difference Result 153 states and 191 transitions. [2019-11-15 23:52:18,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:52:18,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-15 23:52:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:18,840 INFO L225 Difference]: With dead ends: 153 [2019-11-15 23:52:18,841 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 23:52:18,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 23:52:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-15 23:52:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-15 23:52:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 191 transitions. [2019-11-15 23:52:18,846 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 191 transitions. Word has length 38 [2019-11-15 23:52:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:18,846 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 191 transitions. [2019-11-15 23:52:18,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:52:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 191 transitions. [2019-11-15 23:52:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:52:18,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:18,848 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] [2019-11-15 23:52:18,848 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:18,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:18,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2016245838, now seen corresponding path program 1 times [2019-11-15 23:52:18,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:18,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630119650] [2019-11-15 23:52:18,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:18,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:18,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:19,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630119650] [2019-11-15 23:52:19,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:19,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-11-15 23:52:19,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920295139] [2019-11-15 23:52:19,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:52:19,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:19,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:52:19,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:52:19,196 INFO L87 Difference]: Start difference. First operand 153 states and 191 transitions. Second operand 17 states. [2019-11-15 23:52:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:20,153 INFO L93 Difference]: Finished difference Result 149 states and 179 transitions. [2019-11-15 23:52:20,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:52:20,153 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2019-11-15 23:52:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:20,154 INFO L225 Difference]: With dead ends: 149 [2019-11-15 23:52:20,154 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 23:52:20,154 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2019-11-15 23:52:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 23:52:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2019-11-15 23:52:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 23:52:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 173 transitions. [2019-11-15 23:52:20,159 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 173 transitions. Word has length 39 [2019-11-15 23:52:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:20,160 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 173 transitions. [2019-11-15 23:52:20,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:52:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 173 transitions. [2019-11-15 23:52:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:52:20,161 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:20,161 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] [2019-11-15 23:52:20,161 INFO L410 AbstractCegarLoop]: === Iteration 21 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:20,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1864580774, now seen corresponding path program 1 times [2019-11-15 23:52:20,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:20,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612836522] [2019-11-15 23:52:20,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:20,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:20,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:20,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612836522] [2019-11-15 23:52:20,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:20,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 23:52:20,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702108038] [2019-11-15 23:52:20,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:52:20,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:20,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:52:20,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:52:20,422 INFO L87 Difference]: Start difference. First operand 143 states and 173 transitions. Second operand 16 states. [2019-11-15 23:52:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:21,306 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2019-11-15 23:52:21,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:52:21,307 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-11-15 23:52:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:21,308 INFO L225 Difference]: With dead ends: 171 [2019-11-15 23:52:21,308 INFO L226 Difference]: Without dead ends: 171 [2019-11-15 23:52:21,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2019-11-15 23:52:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-15 23:52:21,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 147. [2019-11-15 23:52:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-15 23:52:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2019-11-15 23:52:21,313 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 39 [2019-11-15 23:52:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:21,314 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2019-11-15 23:52:21,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:52:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2019-11-15 23:52:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 23:52:21,314 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:21,314 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:21,315 INFO L410 AbstractCegarLoop]: === Iteration 22 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1795273002, now seen corresponding path program 2 times [2019-11-15 23:52:21,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:21,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907864521] [2019-11-15 23:52:21,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:21,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:21,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907864521] [2019-11-15 23:52:21,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445696806] [2019-11-15 23:52:21,436 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:21,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:52:21,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:52:21,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:52:21,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:21,609 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:21,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-15 23:52:21,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714196281] [2019-11-15 23:52:21,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:52:21,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:21,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:52:21,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:52:21,610 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand 10 states. [2019-11-15 23:52:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:21,839 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-11-15 23:52:21,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:52:21,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-11-15 23:52:21,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:21,841 INFO L225 Difference]: With dead ends: 98 [2019-11-15 23:52:21,841 INFO L226 Difference]: Without dead ends: 87 [2019-11-15 23:52:21,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:52:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-15 23:52:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-15 23:52:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-15 23:52:21,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2019-11-15 23:52:21,843 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 40 [2019-11-15 23:52:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:21,843 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2019-11-15 23:52:21,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:52:21,843 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2019-11-15 23:52:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:52:21,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:21,844 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:22,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:22,047 INFO L410 AbstractCegarLoop]: === Iteration 23 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:22,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:22,048 INFO L82 PathProgramCache]: Analyzing trace with hash -581945730, now seen corresponding path program 1 times [2019-11-15 23:52:22,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:22,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037118010] [2019-11-15 23:52:22,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:22,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:22,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:22,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037118010] [2019-11-15 23:52:22,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329001476] [2019-11-15 23:52:22,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:22,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-15 23:52:22,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:22,688 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:22,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:52:22,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:22,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-15 23:52:22,713 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-15 23:52:22,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:22,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-15 23:52:22,755 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:52:22,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:52:22,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:22,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-15 23:52:22,845 INFO L341 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-11-15 23:52:22,845 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 56 treesize of output 111 [2019-11-15 23:52:22,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:22,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:22,878 INFO L567 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-11-15 23:52:22,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:22,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2019-11-15 23:52:23,330 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 93 treesize of output 73 [2019-11-15 23:52:23,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:23,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:23,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:23,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:100, output treesize:77 [2019-11-15 23:52:23,528 INFO L341 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2019-11-15 23:52:23,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 99 [2019-11-15 23:52:23,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:23,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:23,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:23,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:23,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:23,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:23,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:23,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:23,535 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:23,574 INFO L567 ElimStorePlain]: treesize reduction 36, result has 48.6 percent of original size [2019-11-15 23:52:23,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:23,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:23,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:34 [2019-11-15 23:52:23,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:25,086 WARN L191 SmtUtils]: Spent 722.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-15 23:52:25,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:25,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:52:25,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:52:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:25,103 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:25,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 33 [2019-11-15 23:52:25,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479003669] [2019-11-15 23:52:25,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 23:52:25,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:25,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 23:52:25,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1044, Unknown=1, NotChecked=0, Total=1122 [2019-11-15 23:52:25,105 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 34 states. [2019-11-15 23:52:25,841 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-15 23:52:26,419 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-11-15 23:52:26,653 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2019-11-15 23:52:26,872 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-11-15 23:52:27,065 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2019-11-15 23:52:29,149 WARN L191 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 120 DAG size of output: 110 [2019-11-15 23:52:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:29,934 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2019-11-15 23:52:29,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 23:52:29,935 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 41 [2019-11-15 23:52:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:29,935 INFO L225 Difference]: With dead ends: 100 [2019-11-15 23:52:29,936 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 23:52:29,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=281, Invalid=2580, Unknown=1, NotChecked=0, Total=2862 [2019-11-15 23:52:29,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 23:52:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-15 23:52:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 23:52:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2019-11-15 23:52:29,940 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 41 [2019-11-15 23:52:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:29,940 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2019-11-15 23:52:29,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 23:52:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2019-11-15 23:52:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:52:29,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:29,941 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:30,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:30,144 INFO L410 AbstractCegarLoop]: === Iteration 24 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:30,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:30,145 INFO L82 PathProgramCache]: Analyzing trace with hash -581945729, now seen corresponding path program 1 times [2019-11-15 23:52:30,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:30,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802558775] [2019-11-15 23:52:30,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:30,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802558775] [2019-11-15 23:52:30,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232710663] [2019-11-15 23:52:30,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:31,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-15 23:52:31,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:31,188 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:31,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:52:31,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:31,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:31,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:31,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 23:52:31,230 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-15 23:52:31,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:31,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:31,242 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-15 23:52:31,242 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:31,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:31,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:31,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-11-15 23:52:31,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:31,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-15 23:52:31,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:31,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:31,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:31,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:52:31,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:31,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:31,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:31,336 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2019-11-15 23:52:31,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:31,420 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:31,421 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 101 treesize of output 168 [2019-11-15 23:52:31,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:52:31,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:31,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:52:31,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:31,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 23:52:31,494 INFO L567 ElimStorePlain]: treesize reduction 499, result has 19.4 percent of original size [2019-11-15 23:52:31,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:31,498 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 93 [2019-11-15 23:52:31,499 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:31,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:31,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:31,515 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:108 [2019-11-15 23:52:32,274 INFO L341 Elim1Store]: treesize reduction 20, result has 81.0 percent of original size [2019-11-15 23:52:32,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 242 treesize of output 211 [2019-11-15 23:52:32,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,282 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:32,334 INFO L567 ElimStorePlain]: treesize reduction 96, result has 50.3 percent of original size [2019-11-15 23:52:32,364 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:32,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 82 [2019-11-15 23:52:32,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:32,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:32,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:32,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:32,377 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:242, output treesize:14 [2019-11-15 23:52:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:32,493 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:32,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2019-11-15 23:52:32,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879337472] [2019-11-15 23:52:32,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 23:52:32,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:32,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 23:52:32,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1463, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 23:52:32,495 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 40 states. [2019-11-15 23:52:33,387 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-11-15 23:52:33,633 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2019-11-15 23:52:34,177 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-11-15 23:52:34,421 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 98 [2019-11-15 23:52:34,797 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 130 [2019-11-15 23:52:35,136 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 133 [2019-11-15 23:52:35,545 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 135 [2019-11-15 23:52:36,089 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 138 [2019-11-15 23:52:36,373 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2019-11-15 23:52:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:37,080 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2019-11-15 23:52:37,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 23:52:37,080 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-11-15 23:52:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:37,081 INFO L225 Difference]: With dead ends: 111 [2019-11-15 23:52:37,081 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 23:52:37,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=328, Invalid=3212, Unknown=0, NotChecked=0, Total=3540 [2019-11-15 23:52:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 23:52:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2019-11-15 23:52:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 23:52:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2019-11-15 23:52:37,086 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 41 [2019-11-15 23:52:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:37,086 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2019-11-15 23:52:37,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 23:52:37,086 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2019-11-15 23:52:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 23:52:37,087 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:37,087 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] [2019-11-15 23:52:37,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:37,296 INFO L410 AbstractCegarLoop]: === Iteration 25 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:37,296 INFO L82 PathProgramCache]: Analyzing trace with hash -904096984, now seen corresponding path program 1 times [2019-11-15 23:52:37,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:37,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967066782] [2019-11-15 23:52:37,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:37,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:37,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:37,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967066782] [2019-11-15 23:52:37,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5837942] [2019-11-15 23:52:37,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:37,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:52:37,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:37,551 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 17 treesize of output 9 [2019-11-15 23:52:37,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:37,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:37,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:37,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-11-15 23:52:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:37,557 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:37,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-11-15 23:52:37,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575922112] [2019-11-15 23:52:37,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:52:37,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:37,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:52:37,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:52:37,558 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 9 states. [2019-11-15 23:52:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:38,040 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2019-11-15 23:52:38,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:52:38,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-11-15 23:52:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:38,042 INFO L225 Difference]: With dead ends: 97 [2019-11-15 23:52:38,042 INFO L226 Difference]: Without dead ends: 97 [2019-11-15 23:52:38,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:52:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-15 23:52:38,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-11-15 23:52:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 23:52:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-15 23:52:38,045 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 43 [2019-11-15 23:52:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:38,046 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-15 23:52:38,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:52:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-15 23:52:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 23:52:38,046 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:38,046 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] [2019-11-15 23:52:38,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:38,254 INFO L410 AbstractCegarLoop]: === Iteration 26 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash -904096983, now seen corresponding path program 1 times [2019-11-15 23:52:38,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:38,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713751040] [2019-11-15 23:52:38,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:38,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:38,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:52:38,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713751040] [2019-11-15 23:52:38,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513152149] [2019-11-15 23:52:38,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:38,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:52:38,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:38,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-15 23:52:38,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:38,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:38,760 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 11 [2019-11-15 23:52:38,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:38,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:38,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:38,763 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2019-11-15 23:52:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:38,847 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:38,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 21 [2019-11-15 23:52:38,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797836816] [2019-11-15 23:52:38,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 23:52:38,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:38,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:52:38,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:52:38,848 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 22 states. [2019-11-15 23:52:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:40,304 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2019-11-15 23:52:40,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 23:52:40,305 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2019-11-15 23:52:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:40,306 INFO L225 Difference]: With dead ends: 105 [2019-11-15 23:52:40,306 INFO L226 Difference]: Without dead ends: 105 [2019-11-15 23:52:40,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=344, Invalid=1912, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 23:52:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-15 23:52:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2019-11-15 23:52:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:52:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2019-11-15 23:52:40,310 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 43 [2019-11-15 23:52:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:40,310 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2019-11-15 23:52:40,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 23:52:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2019-11-15 23:52:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:52:40,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:40,311 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] [2019-11-15 23:52:40,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:40,511 INFO L410 AbstractCegarLoop]: === Iteration 27 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:40,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:40,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2040610806, now seen corresponding path program 1 times [2019-11-15 23:52:40,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:40,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977596694] [2019-11-15 23:52:40,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:40,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:40,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:52:40,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977596694] [2019-11-15 23:52:40,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:40,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:52:40,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092790909] [2019-11-15 23:52:40,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:52:40,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:40,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:52:40,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:40,602 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 8 states. [2019-11-15 23:52:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:40,887 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2019-11-15 23:52:40,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:52:40,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-11-15 23:52:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:40,889 INFO L225 Difference]: With dead ends: 101 [2019-11-15 23:52:40,889 INFO L226 Difference]: Without dead ends: 101 [2019-11-15 23:52:40,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:52:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-15 23:52:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-11-15 23:52:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 23:52:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2019-11-15 23:52:40,892 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 44 [2019-11-15 23:52:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:40,893 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2019-11-15 23:52:40,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:52:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2019-11-15 23:52:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:52:40,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:40,894 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:40,894 INFO L410 AbstractCegarLoop]: === Iteration 28 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:40,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:40,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1253753740, now seen corresponding path program 2 times [2019-11-15 23:52:40,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:40,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17906631] [2019-11-15 23:52:40,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:40,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:40,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:41,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17906631] [2019-11-15 23:52:41,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095041654] [2019-11-15 23:52:41,883 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:42,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:52:42,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:52:42,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 91 conjunts are in the unsatisfiable core [2019-11-15 23:52:42,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:42,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:52:42,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:52:42,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,149 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-15 23:52:42,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,158 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-15 23:52:42,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,175 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-15 23:52:42,176 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2019-11-15 23:52:42,346 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:52:42,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:47 [2019-11-15 23:52:42,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-11-15 23:52:42,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-11-15 23:52:42,471 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:50 [2019-11-15 23:52:42,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,556 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 32 treesize of output 34 [2019-11-15 23:52:42,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,585 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 32 treesize of output 34 [2019-11-15 23:52:42,586 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:68 [2019-11-15 23:52:42,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,679 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 41 treesize of output 46 [2019-11-15 23:52:42,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,717 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 41 treesize of output 46 [2019-11-15 23:52:42,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2019-11-15 23:52:42,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:52:42,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:52:42,834 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 108 [2019-11-15 23:52:42,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,880 INFO L567 ElimStorePlain]: treesize reduction 50, result has 70.4 percent of original size [2019-11-15 23:52:42,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:42,884 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 0 case distinctions, treesize of input 68 treesize of output 57 [2019-11-15 23:52:42,885 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:42,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:42,906 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:142, output treesize:96 [2019-11-15 23:52:44,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:44,001 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:52:44,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:44,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:44,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:44,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:52:44,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:44,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 240 treesize of output 181 [2019-11-15 23:52:44,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,103 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:44,176 INFO L567 ElimStorePlain]: treesize reduction 137, result has 38.3 percent of original size [2019-11-15 23:52:44,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:44,213 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 9 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 97 [2019-11-15 23:52:44,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:44,215 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:44,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:44,221 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:254, output treesize:7 [2019-11-15 23:52:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:44,303 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:44,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 47 [2019-11-15 23:52:44,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774906905] [2019-11-15 23:52:44,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-15 23:52:44,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:44,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-15 23:52:44,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2025, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 23:52:44,306 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand 47 states. [2019-11-15 23:52:45,789 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2019-11-15 23:52:46,551 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 124 [2019-11-15 23:52:46,904 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-11-15 23:52:47,114 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-11-15 23:52:47,416 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 126 [2019-11-15 23:52:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:47,882 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2019-11-15 23:52:47,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 23:52:47,882 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 45 [2019-11-15 23:52:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:47,883 INFO L225 Difference]: With dead ends: 102 [2019-11-15 23:52:47,883 INFO L226 Difference]: Without dead ends: 102 [2019-11-15 23:52:47,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=353, Invalid=4203, Unknown=0, NotChecked=0, Total=4556 [2019-11-15 23:52:47,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-15 23:52:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-11-15 23:52:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 23:52:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2019-11-15 23:52:47,888 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 45 [2019-11-15 23:52:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:47,888 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2019-11-15 23:52:47,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-15 23:52:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2019-11-15 23:52:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:52:47,889 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:47,889 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] [2019-11-15 23:52:48,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:48,093 INFO L410 AbstractCegarLoop]: === Iteration 29 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:48,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1253806328, now seen corresponding path program 1 times [2019-11-15 23:52:48,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:48,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226094098] [2019-11-15 23:52:48,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:48,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:48,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:48,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226094098] [2019-11-15 23:52:48,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863054228] [2019-11-15 23:52:48,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:48,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-15 23:52:48,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:48,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:48,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:52:48,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:48,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:48,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:48,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:10 [2019-11-15 23:52:48,782 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-15 23:52:48,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:48,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:48,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:48,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 23:52:48,828 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 23:52:48,828 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 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:52:48,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:48,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:48,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:48,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-11-15 23:52:48,921 INFO L341 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-11-15 23:52:48,921 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 56 treesize of output 111 [2019-11-15 23:52:48,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:48,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:48,940 INFO L567 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-11-15 23:52:48,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:48,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2019-11-15 23:52:49,296 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 93 treesize of output 73 [2019-11-15 23:52:49,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:49,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:49,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:49,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:100, output treesize:77 [2019-11-15 23:52:49,498 INFO L341 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2019-11-15 23:52:49,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 99 [2019-11-15 23:52:49,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:49,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:49,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:49,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:49,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:49,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:49,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:49,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:49,503 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:49,533 INFO L567 ElimStorePlain]: treesize reduction 36, result has 48.6 percent of original size [2019-11-15 23:52:49,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:49,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:49,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:34 [2019-11-15 23:52:49,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:51,132 WARN L191 SmtUtils]: Spent 747.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-15 23:52:51,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:52:51,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:51,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:51,144 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:51,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2019-11-15 23:52:51,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447227282] [2019-11-15 23:52:51,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 23:52:51,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:51,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 23:52:51,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1111, Unknown=1, NotChecked=0, Total=1190 [2019-11-15 23:52:51,146 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 35 states. [2019-11-15 23:52:52,489 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-11-15 23:52:52,729 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-11-15 23:52:52,929 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-11-15 23:52:55,207 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 114 DAG size of output: 109 [2019-11-15 23:52:55,395 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2019-11-15 23:52:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:55,819 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-11-15 23:52:55,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 23:52:55,819 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 45 [2019-11-15 23:52:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:55,820 INFO L225 Difference]: With dead ends: 101 [2019-11-15 23:52:55,820 INFO L226 Difference]: Without dead ends: 101 [2019-11-15 23:52:55,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=270, Invalid=2591, Unknown=1, NotChecked=0, Total=2862 [2019-11-15 23:52:55,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-15 23:52:55,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-11-15 23:52:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 23:52:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-15 23:52:55,824 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 45 [2019-11-15 23:52:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:55,824 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-15 23:52:55,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 23:52:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-15 23:52:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:52:55,825 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:55,825 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:56,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:56,029 INFO L410 AbstractCegarLoop]: === Iteration 30 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:52:56,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:56,029 INFO L82 PathProgramCache]: Analyzing trace with hash 873074319, now seen corresponding path program 1 times [2019-11-15 23:52:56,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:56,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910898535] [2019-11-15 23:52:56,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:56,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:56,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:56,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910898535] [2019-11-15 23:52:56,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90565981] [2019-11-15 23:52:56,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:56,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 23:52:56,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:56,792 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:56,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:52:56,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:56,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:56,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:56,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 23:52:56,878 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-15 23:52:56,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:56,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:56,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:56,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-15 23:52:56,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:56,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 23:52:56,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:56,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:56,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:56,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-11-15 23:52:57,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:57,090 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:52:57,102 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:57,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 60 [2019-11-15 23:52:57,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:57,153 INFO L567 ElimStorePlain]: treesize reduction 40, result has 54.0 percent of original size [2019-11-15 23:52:57,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:52:57,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:47 [2019-11-15 23:52:57,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-11-15 23:52:57,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:57,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:57,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:57,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2019-11-15 23:52:57,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:57,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:57,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:57,783 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:52:57,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:57,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:52:57,786 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:52:57,792 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:57,793 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 10 case distinctions, treesize of input 62 treesize of output 31 [2019-11-15 23:52:57,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:52:57,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:52:57,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:52:57,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:1 [2019-11-15 23:52:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:57,805 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:57,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2019-11-15 23:52:57,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764623958] [2019-11-15 23:52:57,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-15 23:52:57,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:57,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-15 23:52:57,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 23:52:57,807 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 42 states. [2019-11-15 23:53:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:00,237 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2019-11-15 23:53:00,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 23:53:00,240 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 47 [2019-11-15 23:53:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:00,241 INFO L225 Difference]: With dead ends: 101 [2019-11-15 23:53:00,241 INFO L226 Difference]: Without dead ends: 96 [2019-11-15 23:53:00,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=369, Invalid=3413, Unknown=0, NotChecked=0, Total=3782 [2019-11-15 23:53:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-15 23:53:00,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-11-15 23:53:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 23:53:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2019-11-15 23:53:00,247 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 47 [2019-11-15 23:53:00,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:00,247 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2019-11-15 23:53:00,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-15 23:53:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2019-11-15 23:53:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:53:00,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:00,247 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:00,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:00,448 INFO L410 AbstractCegarLoop]: === Iteration 31 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:53:00,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:00,448 INFO L82 PathProgramCache]: Analyzing trace with hash -249303533, now seen corresponding path program 1 times [2019-11-15 23:53:00,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:00,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763379361] [2019-11-15 23:53:00,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:00,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:00,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:53:00,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763379361] [2019-11-15 23:53:00,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721052872] [2019-11-15 23:53:00,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:00,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:53:00,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:53:00,788 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:00,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2019-11-15 23:53:00,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877566797] [2019-11-15 23:53:00,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:53:00,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:00,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:53:00,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:53:00,789 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 8 states. [2019-11-15 23:53:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:01,037 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-11-15 23:53:01,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:53:01,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-15 23:53:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:01,038 INFO L225 Difference]: With dead ends: 98 [2019-11-15 23:53:01,038 INFO L226 Difference]: Without dead ends: 98 [2019-11-15 23:53:01,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:53:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-15 23:53:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-11-15 23:53:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-15 23:53:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2019-11-15 23:53:01,042 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 51 [2019-11-15 23:53:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:01,042 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2019-11-15 23:53:01,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:53:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2019-11-15 23:53:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:53:01,043 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:01,043 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:01,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:01,244 INFO L410 AbstractCegarLoop]: === Iteration 32 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:53:01,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:01,244 INFO L82 PathProgramCache]: Analyzing trace with hash 937591439, now seen corresponding path program 1 times [2019-11-15 23:53:01,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:01,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869747313] [2019-11-15 23:53:01,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:01,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:01,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:53:01,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869747313] [2019-11-15 23:53:01,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286049547] [2019-11-15 23:53:01,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:01,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:53:01,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:01,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:01,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 23:53:01,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:01,709 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-15 23:53:01,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:01,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:18 [2019-11-15 23:53:01,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:53:01,853 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:01,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-11-15 23:53:01,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711105515] [2019-11-15 23:53:01,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 23:53:01,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:01,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 23:53:01,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:53:01,856 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 19 states. [2019-11-15 23:53:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:02,645 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2019-11-15 23:53:02,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:53:02,645 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2019-11-15 23:53:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:02,646 INFO L225 Difference]: With dead ends: 122 [2019-11-15 23:53:02,646 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 23:53:02,646 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992 [2019-11-15 23:53:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 23:53:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-11-15 23:53:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-15 23:53:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2019-11-15 23:53:02,649 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 53 [2019-11-15 23:53:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:02,650 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2019-11-15 23:53:02,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 23:53:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2019-11-15 23:53:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:53:02,650 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:02,650 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:02,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:02,855 INFO L410 AbstractCegarLoop]: === Iteration 33 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:53:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash -999436462, now seen corresponding path program 1 times [2019-11-15 23:53:02,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:02,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368501466] [2019-11-15 23:53:02,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:02,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:02,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:53:03,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368501466] [2019-11-15 23:53:03,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539827709] [2019-11-15 23:53:03,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:03,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-15 23:53:03,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:04,131 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:04,131 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 46 treesize of output 73 [2019-11-15 23:53:04,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:04,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:04,173 INFO L567 ElimStorePlain]: treesize reduction 22, result has 79.0 percent of original size [2019-11-15 23:53:04,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:04,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:04,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:83 [2019-11-15 23:53:04,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:04,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:04,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:04,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:04,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:04,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:04,531 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:04,531 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 59 treesize of output 57 [2019-11-15 23:53:04,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:04,551 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:04,552 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 71 treesize of output 85 [2019-11-15 23:53:04,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:04,553 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:04,583 INFO L567 ElimStorePlain]: treesize reduction 22, result has 74.1 percent of original size [2019-11-15 23:53:04,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:04,583 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:63 [2019-11-15 23:53:04,813 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:04,813 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 58 treesize of output 49 [2019-11-15 23:53:04,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:04,831 INFO L567 ElimStorePlain]: treesize reduction 14, result has 75.0 percent of original size [2019-11-15 23:53:04,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:04,835 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 37 treesize of output 19 [2019-11-15 23:53:04,835 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:04,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:04,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-15 23:53:04,841 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:13 [2019-11-15 23:53:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:53:04,888 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:04,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2019-11-15 23:53:04,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658284913] [2019-11-15 23:53:04,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-15 23:53:04,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:04,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-15 23:53:04,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1304, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 23:53:04,889 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 38 states. [2019-11-15 23:53:09,809 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2019-11-15 23:53:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:12,478 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2019-11-15 23:53:12,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-15 23:53:12,478 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2019-11-15 23:53:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:12,479 INFO L225 Difference]: With dead ends: 146 [2019-11-15 23:53:12,479 INFO L226 Difference]: Without dead ends: 146 [2019-11-15 23:53:12,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=718, Invalid=4832, Unknown=0, NotChecked=0, Total=5550 [2019-11-15 23:53:12,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-15 23:53:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2019-11-15 23:53:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-15 23:53:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2019-11-15 23:53:12,485 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 54 [2019-11-15 23:53:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:12,485 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2019-11-15 23:53:12,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-15 23:53:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2019-11-15 23:53:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:53:12,486 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:12,486 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:12,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:12,690 INFO L410 AbstractCegarLoop]: === Iteration 34 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:53:12,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:12,691 INFO L82 PathProgramCache]: Analyzing trace with hash -999436463, now seen corresponding path program 1 times [2019-11-15 23:53:12,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:12,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758772856] [2019-11-15 23:53:12,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:12,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:12,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:53:13,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758772856] [2019-11-15 23:53:13,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91203687] [2019-11-15 23:53:13,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:14,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 70 conjunts are in the unsatisfiable core [2019-11-15 23:53:14,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:14,468 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-15 23:53:14,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:14,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:14,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:53:14,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-15 23:53:14,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:14,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-15 23:53:14,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:14,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:14,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:14,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-11-15 23:53:14,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:14,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:14,702 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:14,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:14,711 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 56 [2019-11-15 23:53:14,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:14,766 INFO L567 ElimStorePlain]: treesize reduction 20, result has 76.2 percent of original size [2019-11-15 23:53:14,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:14,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:14,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:64 [2019-11-15 23:53:14,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:14,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:15,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:17,670 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-15 23:53:18,421 WARN L191 SmtUtils]: Spent 660.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-15 23:53:18,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:18,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-15 23:53:18,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:18,457 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.9 percent of original size [2019-11-15 23:53:18,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:18,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:18,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:51 [2019-11-15 23:53:18,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:19,618 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 30 [2019-11-15 23:53:19,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:19,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:19,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:19,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:19,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:19,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:19,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:19,791 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:19,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:19,854 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:19,855 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 121 treesize of output 215 [2019-11-15 23:53:19,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:19,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:19,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:19,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:19,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:19,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:19,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:19,869 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:19,880 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:19,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:19,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:19,911 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:19,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:19,973 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:19,974 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 12 case distinctions, treesize of input 124 treesize of output 1 [2019-11-15 23:53:19,974 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:19,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:20,023 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:20,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:20,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:20,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:20,028 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:20,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:20,107 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 14 case distinctions, treesize of input 125 treesize of output 262 [2019-11-15 23:53:20,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:20,633 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:53:20,653 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:20,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:20,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:20,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:20,710 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:20,711 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 197 [2019-11-15 23:53:20,711 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:21,029 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 96 [2019-11-15 23:53:21,030 INFO L567 ElimStorePlain]: treesize reduction 1553, result has 17.8 percent of original size [2019-11-15 23:53:21,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2019-11-15 23:53:21,033 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:491, output treesize:336 [2019-11-15 23:53:21,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:21,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:22,296 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 122 [2019-11-15 23:53:22,836 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2019-11-15 23:53:22,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 23:53:22,844 INFO L392 ElimStorePlain]: Different costs {10=[|#memory_$Pointer$.base|, v_prenex_25], 18=[v_prenex_19, v_prenex_21], 28=[v_prenex_23]} [2019-11-15 23:53:22,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:22,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:22,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:22,861 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:22,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:22,866 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:22,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 55 [2019-11-15 23:53:22,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:23,003 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2019-11-15 23:53:23,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:23,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,019 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:23,023 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:23,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 55 [2019-11-15 23:53:23,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:23,272 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 153 [2019-11-15 23:53:23,272 INFO L567 ElimStorePlain]: treesize reduction 8, result has 98.1 percent of original size [2019-11-15 23:53:23,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,283 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:23,307 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:23,308 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 10 case distinctions, treesize of input 105 treesize of output 110 [2019-11-15 23:53:23,309 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:23,540 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 139 [2019-11-15 23:53:23,541 INFO L567 ElimStorePlain]: treesize reduction 30, result has 92.1 percent of original size [2019-11-15 23:53:23,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:23,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,555 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:23,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:23,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 111 treesize of output 70 [2019-11-15 23:53:23,563 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:23,764 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 119 [2019-11-15 23:53:23,764 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.6 percent of original size [2019-11-15 23:53:23,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,774 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:23,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:53:23,777 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:53:23,813 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:53:23,813 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 7 new quantified variables, introduced 15 case distinctions, treesize of input 126 treesize of output 141 [2019-11-15 23:53:23,814 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:53:23,992 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-11-15 23:53:23,992 INFO L567 ElimStorePlain]: treesize reduction 46, result has 81.4 percent of original size [2019-11-15 23:53:23,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 5 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2019-11-15 23:53:23,994 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 29 variables, input treesize:519, output treesize:76 [2019-11-15 23:53:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:53:24,141 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:24,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 32] total 58 [2019-11-15 23:53:24,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473078797] [2019-11-15 23:53:24,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-11-15 23:53:24,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:24,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-11-15 23:53:24,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3232, Unknown=1, NotChecked=0, Total=3422 [2019-11-15 23:53:24,142 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 59 states. [2019-11-15 23:53:25,715 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-11-15 23:53:27,117 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-11-15 23:53:27,718 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-11-15 23:53:29,761 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2019-11-15 23:53:32,012 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 23:53:33,205 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 23:53:34,051 WARN L191 SmtUtils]: Spent 738.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-15 23:53:37,667 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2019-11-15 23:53:40,815 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 148 [2019-11-15 23:53:44,236 WARN L191 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 208 [2019-11-15 23:53:48,614 WARN L191 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 219 [2019-11-15 23:53:52,857 WARN L191 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 236 [2019-11-15 23:53:59,218 WARN L191 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 237 [2019-11-15 23:54:03,911 WARN L191 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 239 [2019-11-15 23:54:09,351 WARN L191 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 253 [2019-11-15 23:54:18,933 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 218 [2019-11-15 23:54:25,394 WARN L191 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 217 [2019-11-15 23:54:29,821 WARN L191 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 243 [2019-11-15 23:54:36,043 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 314 DAG size of output: 225 [2019-11-15 23:54:41,523 WARN L191 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 239 [2019-11-15 23:54:49,881 WARN L191 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 237 [2019-11-15 23:54:54,930 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 23:54:59,042 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 213 [2019-11-15 23:55:02,012 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 84 [2019-11-15 23:55:03,560 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 23:55:07,388 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 223 [2019-11-15 23:55:10,207 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-11-15 23:55:14,507 WARN L191 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 23:55:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:14,772 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2019-11-15 23:55:14,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-11-15 23:55:14,773 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 54 [2019-11-15 23:55:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:14,774 INFO L225 Difference]: With dead ends: 158 [2019-11-15 23:55:14,774 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 23:55:14,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2777 ImplicationChecksByTransitivity, 76.4s TimeCoverageRelationStatistics Valid=1143, Invalid=11262, Unknown=27, NotChecked=0, Total=12432 [2019-11-15 23:55:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 23:55:14,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 123. [2019-11-15 23:55:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 23:55:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2019-11-15 23:55:14,781 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 54 [2019-11-15 23:55:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:14,781 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2019-11-15 23:55:14,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-11-15 23:55:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2019-11-15 23:55:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 23:55:14,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:14,782 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:14,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:14,989 INFO L410 AbstractCegarLoop]: === Iteration 35 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:55:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:14,990 INFO L82 PathProgramCache]: Analyzing trace with hash 795652056, now seen corresponding path program 1 times [2019-11-15 23:55:14,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:14,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113463301] [2019-11-15 23:55:14,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:14,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:14,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:55:15,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113463301] [2019-11-15 23:55:15,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092283747] [2019-11-15 23:55:15,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:15,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:55:15,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:15,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-15 23:55:15,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:55:15,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:55:15,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-11-15 23:55:15,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:55:15,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:55:15,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:55:15,759 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2019-11-15 23:55:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:55:15,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:55:15,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25 [2019-11-15 23:55:15,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327163356] [2019-11-15 23:55:15,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:55:15,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:15,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:55:15,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-11-15 23:55:15,817 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 6 states. [2019-11-15 23:55:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:16,033 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2019-11-15 23:55:16,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:55:16,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-15 23:55:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:16,034 INFO L225 Difference]: With dead ends: 125 [2019-11-15 23:55:16,035 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 23:55:16,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-11-15 23:55:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 23:55:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-11-15 23:55:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 23:55:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2019-11-15 23:55:16,038 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 58 [2019-11-15 23:55:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:16,039 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2019-11-15 23:55:16,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:55:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2019-11-15 23:55:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 23:55:16,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:16,039 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:16,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:16,240 INFO L410 AbstractCegarLoop]: === Iteration 36 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:55:16,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:16,240 INFO L82 PathProgramCache]: Analyzing trace with hash 795221106, now seen corresponding path program 1 times [2019-11-15 23:55:16,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:16,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270985692] [2019-11-15 23:55:16,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:16,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:55:16,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270985692] [2019-11-15 23:55:16,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942985562] [2019-11-15 23:55:16,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:55:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:16,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-15 23:55:16,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:16,995 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 9 treesize of output 5 [2019-11-15 23:55:16,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:55:17,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:55:17,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:55:17,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:3 [2019-11-15 23:55:17,941 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_remove_last_~snd_to_last~0.offset Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_remove_last_#in~head.base|) |c_dll_remove_last_#in~head.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) (+ dll_remove_last_~snd_to_last~0.offset 4) 0))))) is different from true [2019-11-15 23:55:17,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:55:17,960 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 31 treesize of output 53 [2019-11-15 23:55:17,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:55:17,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:17,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:17,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 23:55:17,997 INFO L567 ElimStorePlain]: treesize reduction 112, result has 21.1 percent of original size [2019-11-15 23:55:17,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:55:17,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-11-15 23:55:18,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:55:18,127 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 30 treesize of output 29 [2019-11-15 23:55:18,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:18,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:18,128 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:55:18,138 INFO L567 ElimStorePlain]: treesize reduction 14, result has 46.2 percent of original size [2019-11-15 23:55:18,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:55:18,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2019-11-15 23:55:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:55:18,145 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:55:18,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 28 [2019-11-15 23:55:18,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124515945] [2019-11-15 23:55:18,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 23:55:18,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:18,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 23:55:18,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=671, Unknown=1, NotChecked=52, Total=812 [2019-11-15 23:55:18,147 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand 29 states. [2019-11-15 23:55:24,931 WARN L191 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-11-15 23:55:37,802 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-11-15 23:55:55,237 WARN L191 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-15 23:56:10,515 WARN L191 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-11-15 23:56:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:18,869 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2019-11-15 23:56:18,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-15 23:56:18,870 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-11-15 23:56:18,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:18,870 INFO L225 Difference]: With dead ends: 147 [2019-11-15 23:56:18,870 INFO L226 Difference]: Without dead ends: 147 [2019-11-15 23:56:18,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 61.1s TimeCoverageRelationStatistics Valid=503, Invalid=2851, Unknown=72, NotChecked=114, Total=3540 [2019-11-15 23:56:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-15 23:56:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2019-11-15 23:56:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 23:56:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2019-11-15 23:56:18,874 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 58 [2019-11-15 23:56:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:18,874 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2019-11-15 23:56:18,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 23:56:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2019-11-15 23:56:18,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 23:56:18,875 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:18,875 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:19,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:19,076 INFO L410 AbstractCegarLoop]: === Iteration 37 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:56:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:19,076 INFO L82 PathProgramCache]: Analyzing trace with hash -296693451, now seen corresponding path program 1 times [2019-11-15 23:56:19,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:19,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953725693] [2019-11-15 23:56:19,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:19,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:19,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 23:56:19,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953725693] [2019-11-15 23:56:19,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992460249] [2019-11-15 23:56:19,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:19,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:56:19,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:19,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:19,442 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 12 treesize of output 14 [2019-11-15 23:56:19,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:19,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:19,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:19,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-11-15 23:56:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-15 23:56:19,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:56:19,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 13 [2019-11-15 23:56:19,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375582758] [2019-11-15 23:56:19,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:56:19,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:19,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:56:19,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:56:19,467 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand 8 states. [2019-11-15 23:56:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:19,609 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2019-11-15 23:56:19,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:56:19,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-11-15 23:56:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:19,610 INFO L225 Difference]: With dead ends: 127 [2019-11-15 23:56:19,610 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 23:56:19,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:56:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 23:56:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-11-15 23:56:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 23:56:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2019-11-15 23:56:19,614 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 60 [2019-11-15 23:56:19,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:19,614 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2019-11-15 23:56:19,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:56:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2019-11-15 23:56:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 23:56:19,614 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:19,614 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:19,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:19,819 INFO L410 AbstractCegarLoop]: === Iteration 38 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:56:19,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:19,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1197695309, now seen corresponding path program 1 times [2019-11-15 23:56:19,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:19,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336019343] [2019-11-15 23:56:19,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:19,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:19,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:56:20,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336019343] [2019-11-15 23:56:20,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167449321] [2019-11-15 23:56:20,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:20,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 65 conjunts are in the unsatisfiable core [2019-11-15 23:56:20,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:21,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:21,248 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 51 treesize of output 77 [2019-11-15 23:56:21,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:21,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:21,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:21,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 23:56:21,311 INFO L567 ElimStorePlain]: treesize reduction 153, result has 34.9 percent of original size [2019-11-15 23:56:21,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 23:56:21,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:82 [2019-11-15 23:56:21,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:21,398 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:21,398 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 50 treesize of output 52 [2019-11-15 23:56:21,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:21,415 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:21,415 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 55 treesize of output 81 [2019-11-15 23:56:21,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:21,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:21,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:21,416 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:21,441 INFO L567 ElimStorePlain]: treesize reduction 114, result has 29.6 percent of original size [2019-11-15 23:56:21,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:56:21,442 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:106, output treesize:47 [2019-11-15 23:56:21,743 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:21,743 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 78 treesize of output 59 [2019-11-15 23:56:21,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:21,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:21,745 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:21,759 INFO L567 ElimStorePlain]: treesize reduction 18, result has 66.0 percent of original size [2019-11-15 23:56:21,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:21,762 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 27 treesize of output 12 [2019-11-15 23:56:21,762 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:21,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:21,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:56:21,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:7 [2019-11-15 23:56:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:56:21,820 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:21,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2019-11-15 23:56:21,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687543256] [2019-11-15 23:56:21,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-15 23:56:21,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:21,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-15 23:56:21,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1622, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 23:56:21,821 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand 42 states. [2019-11-15 23:56:24,361 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 53 [2019-11-15 23:56:24,582 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 57 [2019-11-15 23:56:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:25,062 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2019-11-15 23:56:25,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 23:56:25,062 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 62 [2019-11-15 23:56:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:25,063 INFO L225 Difference]: With dead ends: 115 [2019-11-15 23:56:25,063 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 23:56:25,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=358, Invalid=3548, Unknown=0, NotChecked=0, Total=3906 [2019-11-15 23:56:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 23:56:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2019-11-15 23:56:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 23:56:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2019-11-15 23:56:25,066 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 62 [2019-11-15 23:56:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:25,066 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2019-11-15 23:56:25,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-15 23:56:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2019-11-15 23:56:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:56:25,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:25,067 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:25,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:25,268 INFO L410 AbstractCegarLoop]: === Iteration 39 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:56:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:25,268 INFO L82 PathProgramCache]: Analyzing trace with hash 264217118, now seen corresponding path program 1 times [2019-11-15 23:56:25,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:25,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785191716] [2019-11-15 23:56:25,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:25,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:25,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 23:56:25,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785191716] [2019-11-15 23:56:25,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:25,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:56:25,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065610759] [2019-11-15 23:56:25,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:56:25,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:25,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:56:25,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:56:25,375 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 9 states. [2019-11-15 23:56:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:25,594 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2019-11-15 23:56:25,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:56:25,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-11-15 23:56:25,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:25,595 INFO L225 Difference]: With dead ends: 68 [2019-11-15 23:56:25,595 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 23:56:25,595 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:56:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 23:56:25,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-15 23:56:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 23:56:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 67 transitions. [2019-11-15 23:56:25,597 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 67 transitions. Word has length 68 [2019-11-15 23:56:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:25,598 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 67 transitions. [2019-11-15 23:56:25,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:56:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2019-11-15 23:56:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:56:25,598 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:25,599 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:25,599 INFO L410 AbstractCegarLoop]: === Iteration 40 === [dll_remove_lastErr10REQUIRES_VIOLATION, dll_remove_lastErr0REQUIRES_VIOLATION, dll_remove_lastErr11REQUIRES_VIOLATION, dll_remove_lastErr21ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr19ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr1REQUIRES_VIOLATION, dll_remove_lastErr12REQUIRES_VIOLATION, dll_remove_lastErr20ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr18REQUIRES_VIOLATION, dll_remove_lastErr7ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr6ASSERT_VIOLATIONMEMORY_FREE, dll_remove_lastErr9REQUIRES_VIOLATION, dll_remove_lastErr15REQUIRES_VIOLATION, dll_remove_lastErr5REQUIRES_VIOLATION, dll_remove_lastErr16REQUIRES_VIOLATION, dll_remove_lastErr17REQUIRES_VIOLATION, dll_remove_lastErr2REQUIRES_VIOLATION, dll_remove_lastErr13REQUIRES_VIOLATION, dll_remove_lastErr3REQUIRES_VIOLATION, dll_remove_lastErr14REQUIRES_VIOLATION, dll_remove_lastErr4REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-15 23:56:25,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:25,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1931255031, now seen corresponding path program 1 times [2019-11-15 23:56:25,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:25,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885536269] [2019-11-15 23:56:25,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:25,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:25,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:56:27,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885536269] [2019-11-15 23:56:27,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669111923] [2019-11-15 23:56:27,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:27,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 97 conjunts are in the unsatisfiable core [2019-11-15 23:56:27,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:27,833 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 5 treesize of output 3 [2019-11-15 23:56:27,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:27,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:27,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:56:27,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2019-11-15 23:56:27,865 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:27,910 INFO L567 ElimStorePlain]: treesize reduction 21, result has 66.7 percent of original size [2019-11-15 23:56:27,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:27,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:42 [2019-11-15 23:56:28,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 23:56:28,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:28,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:28,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:28,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2019-11-15 23:56:28,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:28,255 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-15 23:56:28,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:28,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:28,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:28,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:63 [2019-11-15 23:56:28,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:28,390 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:28,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 120 [2019-11-15 23:56:28,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:28,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:28,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:28,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:28,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:28,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:28,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-15 23:56:28,496 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 39 [2019-11-15 23:56:28,496 INFO L567 ElimStorePlain]: treesize reduction 891, result has 9.0 percent of original size [2019-11-15 23:56:28,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:28,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:87 [2019-11-15 23:56:33,248 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-11-15 23:56:35,419 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2019-11-15 23:56:35,423 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_31|], 20=[|v_#memory_$Pointer$.base_BEFORE_CALL_20|]} [2019-11-15 23:56:35,427 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 158 treesize of output 126 [2019-11-15 23:56:35,427 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:35,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:35,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:35,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:35,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:35,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:35,563 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 164 treesize of output 290 [2019-11-15 23:56:35,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:35,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:35,923 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:36,157 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-11-15 23:56:36,157 INFO L567 ElimStorePlain]: treesize reduction 138, result has 50.4 percent of original size [2019-11-15 23:56:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:36,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:36,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:36,161 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:210, output treesize:165 [2019-11-15 23:56:36,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:36,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:36,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:36,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:36,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:36,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:38,727 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2019-11-15 23:56:41,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:56:41,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:41,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:41,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:41,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:41,169 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:41,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 125 treesize of output 114 [2019-11-15 23:56:41,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:41,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:41,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:41,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:41,171 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:41,554 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-11-15 23:56:41,554 INFO L567 ElimStorePlain]: treesize reduction 47, result has 89.3 percent of original size [2019-11-15 23:56:41,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:41,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:41,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:41,622 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:41,622 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 6 case distinctions, treesize of input 160 treesize of output 126 [2019-11-15 23:56:41,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:41,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:41,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:41,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:41,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:41,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:41,627 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:42,062 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2019-11-15 23:56:42,062 INFO L567 ElimStorePlain]: treesize reduction 30, result has 90.9 percent of original size [2019-11-15 23:56:42,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:42,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:42,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:42,103 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:42,103 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 6 case distinctions, treesize of input 162 treesize of output 128 [2019-11-15 23:56:42,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:42,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:42,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:42,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:42,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:42,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:42,108 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:42,450 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-11-15 23:56:42,450 INFO L567 ElimStorePlain]: treesize reduction 32, result has 86.7 percent of original size [2019-11-15 23:56:42,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-2 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2019-11-15 23:56:42,452 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:463, output treesize:191 [2019-11-15 23:56:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:42,852 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:56:42,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 57 [2019-11-15 23:56:42,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475445467] [2019-11-15 23:56:42,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-11-15 23:56:42,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:42,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-11-15 23:56:42,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=3123, Unknown=2, NotChecked=0, Total=3306 [2019-11-15 23:56:42,853 INFO L87 Difference]: Start difference. First operand 68 states and 67 transitions. Second operand 58 states. [2019-11-15 23:56:44,094 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-11-15 23:56:59,130 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-15 23:57:02,370 WARN L191 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-11-15 23:57:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:02,913 INFO L93 Difference]: Finished difference Result 67 states and 66 transitions. [2019-11-15 23:57:02,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 23:57:02,913 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 67 [2019-11-15 23:57:02,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:02,913 INFO L225 Difference]: With dead ends: 67 [2019-11-15 23:57:02,913 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:57:02,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=360, Invalid=5038, Unknown=4, NotChecked=0, Total=5402 [2019-11-15 23:57:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:57:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:57:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:57:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:57:02,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-11-15 23:57:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:02,915 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:57:02,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-11-15 23:57:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:57:02,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:57:03,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:03,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:57:03 BoogieIcfgContainer [2019-11-15 23:57:03,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:57:03,119 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:57:03,119 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:57:03,120 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:57:03,120 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:04" (3/4) ... [2019-11-15 23:57:03,122 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:57:03,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_remove_last [2019-11-15 23:57:03,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-15 23:57:03,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-15 23:57:03,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2019-11-15 23:57:03,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-15 23:57:03,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-15 23:57:03,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-15 23:57:03,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-11-15 23:57:03,134 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-15 23:57:03,134 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-15 23:57:03,135 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:57:03,171 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3520d13e-40e9-412b-afb8-75777fbc2f0c/bin/uautomizer/witness.graphml [2019-11-15 23:57:03,172 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:57:03,173 INFO L168 Benchmark]: Toolchain (without parser) took 300351.72 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 558.4 MB). Free memory was 939.3 MB in the beginning and 947.2 MB in the end (delta: -7.9 MB). Peak memory consumption was 550.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:03,173 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:57:03,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:03,174 INFO L168 Benchmark]: Boogie Preprocessor took 66.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:57:03,174 INFO L168 Benchmark]: RCFGBuilder took 835.83 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: 62.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:03,174 INFO L168 Benchmark]: TraceAbstraction took 298877.39 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 426.2 MB). Free memory was 1.0 GB in the beginning and 952.2 MB in the end (delta: 86.1 MB). Peak memory consumption was 512.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:03,175 INFO L168 Benchmark]: Witness Printer took 52.51 ms. Allocated memory is still 1.6 GB. Free memory was 952.2 MB in the beginning and 947.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:03,176 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 515.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -161.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 835.83 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: 62.5 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 298877.39 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 426.2 MB). Free memory was 1.0 GB in the beginning and 952.2 MB in the end (delta: 86.1 MB). Peak memory consumption was 512.4 MB. Max. memory is 11.5 GB. * Witness Printer took 52.51 ms. Allocated memory is still 1.6 GB. Free memory was 952.2 MB in the beginning and 947.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 601]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 601]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 599]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 599]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 615]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 109 locations, 39 error locations. Result: SAFE, OverallTime: 298.8s, OverallIterations: 40, TraceHistogramMax: 3, AutomataDifference: 236.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1556 SDtfs, 6759 SDslu, 6434 SDs, 0 SdLazy, 26525 SolverSat, 1200 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 69.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2115 GetRequests, 956 SyntacticMatches, 44 SemanticMatches, 1115 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10215 ImplicationChecksByTransitivity, 206.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 40 MinimizatonAttempts, 456 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 52.2s InterpolantComputationTime, 2577 NumberOfCodeBlocks, 2577 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 2514 ConstructedInterpolants, 183 QuantifiedInterpolants, 1904748 SizeOfPredicates, 274 NumberOfNonLiveVariables, 5971 ConjunctsInSsa, 831 ConjunctsInUnsatCore, 63 InterpolantComputations, 19 PerfectInterpolantSequences, 416/743 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...