./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.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_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 acdd122f5068e78adf2c5d9843dc58624176c7bc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 acdd122f5068e78adf2c5d9843dc58624176c7bc ..................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:51:06,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:51:06,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:51:06,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:51:06,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:51:06,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:51:06,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:51:06,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:51:06,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:51:06,152 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:51:06,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:51:06,154 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:51:06,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:51:06,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:51:06,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:51:06,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:51:06,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:51:06,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:51:06,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:51:06,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:51:06,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:51:06,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:51:06,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:51:06,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:51:06,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:51:06,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:51:06,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:51:06,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:51:06,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:51:06,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:51:06,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:51:06,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:51:06,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:51:06,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:51:06,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:51:06,181 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:51:06,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:51:06,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:51:06,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:51:06,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:51:06,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:51:06,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:51:06,200 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:51:06,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:51:06,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:51:06,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:51:06,202 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:51:06,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:51:06,203 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:51:06,203 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:51:06,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:51:06,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:51:06,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:51:06,204 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:51:06,205 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:51:06,205 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:51:06,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:51:06,205 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:51:06,206 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:51:06,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:51:06,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:51:06,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:51:06,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:51:06,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:51:06,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:51:06,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:51:06,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:51:06,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:51:06,209 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_cca8c939-34a4-4da7-a8a6-0af484174f98/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 -> acdd122f5068e78adf2c5d9843dc58624176c7bc [2019-11-15 21:51:06,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:51:06,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:51:06,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:51:06,257 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:51:06,258 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:51:06,258 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2019-11-15 21:51:06,318 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/data/76977ad32/86a7a296566e4e81aa0024c00ef717fb/FLAG88a6b816d [2019-11-15 21:51:06,859 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:51:06,859 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2019-11-15 21:51:06,874 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/data/76977ad32/86a7a296566e4e81aa0024c00ef717fb/FLAG88a6b816d [2019-11-15 21:51:07,163 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/data/76977ad32/86a7a296566e4e81aa0024c00ef717fb [2019-11-15 21:51:07,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:51:07,169 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:51:07,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:51:07,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:51:07,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:51:07,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:51:07" (1/1) ... [2019-11-15 21:51:07,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f289042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:51:07, skipping insertion in model container [2019-11-15 21:51:07,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:51:07" (1/1) ... [2019-11-15 21:51:07,185 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:51:07,245 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:51:07,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:51:07,702 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:51:07,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:51:07,802 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:51:07,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:51:07 WrapperNode [2019-11-15 21:51:07,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:51:07,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:51:07,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:51:07,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:51:07,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:51:07" (1/1) ... [2019-11-15 21:51:07,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:51:07" (1/1) ... [2019-11-15 21:51:07,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:51:07" (1/1) ... [2019-11-15 21:51:07,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:51:07" (1/1) ... [2019-11-15 21:51:07,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:51:07" (1/1) ... [2019-11-15 21:51:07,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:51:07" (1/1) ... [2019-11-15 21:51:07,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:51:07" (1/1) ... [2019-11-15 21:51:07,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:51:07,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:51:07,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:51:07,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:51:07,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:51:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:07,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:51:07,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:51:07,933 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:51:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:51:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:51:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:51:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:51:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:51:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:51:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:51:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:51:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:51:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:51:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:51:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:51:07,938 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:51:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:51:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:51:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:51:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:51:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:51:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:51:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:51:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:51:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:51:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:51:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:51:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:51:07,945 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:51:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:51:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:51:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:51:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:51:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:51:07,946 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:51:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:51:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:51:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:51:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:51:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:51:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:51:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:51:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:51:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:51:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:51:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:51:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:51:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:51:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:51:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:51:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:51:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:51:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:51:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:51:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:51:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:51:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:51:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:51:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:51:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:51:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:51:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:51:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:51:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:51:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:51:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:51:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:51:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:51:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:51:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:51:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:51:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:51:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:51:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:51:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:51:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:51:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:51:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:51:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:51:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:51:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:51:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:51:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:51:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:51:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:51:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:51:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:51:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:51:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:51:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:51:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:51:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:51:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:51:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:51:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:51:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:51:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:51:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:51:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:51:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:51:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 21:51:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:51:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:51:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:51:07,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:51:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:51:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:51:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:51:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:51:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:51:07,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:51:08,714 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:51:08,715 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 21:51:08,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:51:08 BoogieIcfgContainer [2019-11-15 21:51:08,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:51:08,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:51:08,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:51:08,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:51:08,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:51:07" (1/3) ... [2019-11-15 21:51:08,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cc743d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:51:08, skipping insertion in model container [2019-11-15 21:51:08,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:51:07" (2/3) ... [2019-11-15 21:51:08,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cc743d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:51:08, skipping insertion in model container [2019-11-15 21:51:08,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:51:08" (3/3) ... [2019-11-15 21:51:08,727 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2019-11-15 21:51:08,738 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:51:08,750 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 54 error locations. [2019-11-15 21:51:08,759 INFO L249 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2019-11-15 21:51:08,780 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:51:08,780 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:51:08,780 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:51:08,780 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:51:08,780 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:51:08,780 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:51:08,780 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:51:08,781 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:51:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-11-15 21:51:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 21:51:08,809 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:08,809 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:08,811 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:08,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1771404111, now seen corresponding path program 1 times [2019-11-15 21:51:08,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:08,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463819542] [2019-11-15 21:51:08,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:08,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:08,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:09,015 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 21:51:09,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463819542] [2019-11-15 21:51:09,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:09,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:51:09,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508299528] [2019-11-15 21:51:09,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:51:09,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:09,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:51:09,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:51:09,043 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 4 states. [2019-11-15 21:51:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:09,481 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2019-11-15 21:51:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:51:09,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 21:51:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:09,498 INFO L225 Difference]: With dead ends: 124 [2019-11-15 21:51:09,499 INFO L226 Difference]: Without dead ends: 121 [2019-11-15 21:51:09,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:51:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-15 21:51:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-15 21:51:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 21:51:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2019-11-15 21:51:09,572 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 7 [2019-11-15 21:51:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:09,573 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2019-11-15 21:51:09,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:51:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2019-11-15 21:51:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 21:51:09,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:09,574 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:09,575 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1771404110, now seen corresponding path program 1 times [2019-11-15 21:51:09,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:09,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744273656] [2019-11-15 21:51:09,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:09,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:09,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:09,640 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 21:51:09,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744273656] [2019-11-15 21:51:09,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:09,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:51:09,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909298699] [2019-11-15 21:51:09,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:51:09,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:09,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:51:09,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:51:09,644 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 4 states. [2019-11-15 21:51:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:09,958 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-11-15 21:51:09,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:51:09,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 21:51:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:09,960 INFO L225 Difference]: With dead ends: 119 [2019-11-15 21:51:09,960 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 21:51:09,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:51:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 21:51:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-11-15 21:51:09,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-15 21:51:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2019-11-15 21:51:09,979 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 7 [2019-11-15 21:51:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:09,980 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2019-11-15 21:51:09,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:51:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2019-11-15 21:51:09,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:51:09,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:09,981 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:09,981 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:09,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:09,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1211483293, now seen corresponding path program 1 times [2019-11-15 21:51:09,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:09,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566548608] [2019-11-15 21:51:09,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:09,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:09,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:10,086 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 21:51:10,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566548608] [2019-11-15 21:51:10,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:10,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:51:10,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184268578] [2019-11-15 21:51:10,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:51:10,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:10,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:51:10,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:51:10,089 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 5 states. [2019-11-15 21:51:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:10,502 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2019-11-15 21:51:10,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:51:10,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 21:51:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:10,503 INFO L225 Difference]: With dead ends: 113 [2019-11-15 21:51:10,504 INFO L226 Difference]: Without dead ends: 113 [2019-11-15 21:51:10,504 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:51:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-15 21:51:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2019-11-15 21:51:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 21:51:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2019-11-15 21:51:10,514 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 12 [2019-11-15 21:51:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:10,514 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2019-11-15 21:51:10,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:51:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2019-11-15 21:51:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 21:51:10,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:10,515 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:10,516 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1211483294, now seen corresponding path program 1 times [2019-11-15 21:51:10,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:10,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061810969] [2019-11-15 21:51:10,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:10,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:10,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:10,610 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 21:51:10,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061810969] [2019-11-15 21:51:10,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:10,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:51:10,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55589109] [2019-11-15 21:51:10,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:51:10,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:10,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:51:10,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:51:10,613 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 5 states. [2019-11-15 21:51:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:10,993 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2019-11-15 21:51:10,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:51:10,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-15 21:51:10,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:10,995 INFO L225 Difference]: With dead ends: 140 [2019-11-15 21:51:10,995 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 21:51:10,996 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:51:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 21:51:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2019-11-15 21:51:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-15 21:51:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2019-11-15 21:51:11,007 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 12 [2019-11-15 21:51:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:11,007 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2019-11-15 21:51:11,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:51:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2019-11-15 21:51:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:51:11,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:11,008 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:11,009 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 688586621, now seen corresponding path program 1 times [2019-11-15 21:51:11,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:11,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65974727] [2019-11-15 21:51:11,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:11,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:11,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:11,097 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 21:51:11,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65974727] [2019-11-15 21:51:11,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:11,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:51:11,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365090636] [2019-11-15 21:51:11,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:51:11,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:11,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:51:11,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:51:11,099 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand 7 states. [2019-11-15 21:51:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:11,747 INFO L93 Difference]: Finished difference Result 234 states and 258 transitions. [2019-11-15 21:51:11,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:51:11,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 21:51:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:11,749 INFO L225 Difference]: With dead ends: 234 [2019-11-15 21:51:11,749 INFO L226 Difference]: Without dead ends: 234 [2019-11-15 21:51:11,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:51:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-15 21:51:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 128. [2019-11-15 21:51:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-15 21:51:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2019-11-15 21:51:11,760 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 15 [2019-11-15 21:51:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:11,761 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2019-11-15 21:51:11,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:51:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2019-11-15 21:51:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:51:11,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:11,762 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:11,762 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:11,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:11,762 INFO L82 PathProgramCache]: Analyzing trace with hash 688586622, now seen corresponding path program 1 times [2019-11-15 21:51:11,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:11,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001156122] [2019-11-15 21:51:11,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:11,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:11,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:11,861 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 21:51:11,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001156122] [2019-11-15 21:51:11,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:11,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:51:11,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359037859] [2019-11-15 21:51:11,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:51:11,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:11,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:51:11,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:51:11,863 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand 7 states. [2019-11-15 21:51:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:12,674 INFO L93 Difference]: Finished difference Result 229 states and 255 transitions. [2019-11-15 21:51:12,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:51:12,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-15 21:51:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:12,676 INFO L225 Difference]: With dead ends: 229 [2019-11-15 21:51:12,676 INFO L226 Difference]: Without dead ends: 229 [2019-11-15 21:51:12,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:51:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-15 21:51:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 120. [2019-11-15 21:51:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 21:51:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2019-11-15 21:51:12,685 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 15 [2019-11-15 21:51:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:12,686 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2019-11-15 21:51:12,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:51:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2019-11-15 21:51:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:51:12,687 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:12,687 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:12,687 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:12,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:12,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1891765132, now seen corresponding path program 1 times [2019-11-15 21:51:12,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:12,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566079207] [2019-11-15 21:51:12,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:12,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:12,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:12,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566079207] [2019-11-15 21:51:12,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:12,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:51:12,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805788742] [2019-11-15 21:51:12,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:51:12,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:12,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:51:12,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:51:12,743 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 4 states. [2019-11-15 21:51:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:12,889 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2019-11-15 21:51:12,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:51:12,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-15 21:51:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:12,895 INFO L225 Difference]: With dead ends: 122 [2019-11-15 21:51:12,895 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 21:51:12,895 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 21:51:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 21:51:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-11-15 21:51:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 21:51:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2019-11-15 21:51:12,903 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 21 [2019-11-15 21:51:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:12,903 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2019-11-15 21:51:12,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:51:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2019-11-15 21:51:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:51:12,904 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:12,904 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:12,905 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:12,905 INFO L82 PathProgramCache]: Analyzing trace with hash 116757770, now seen corresponding path program 1 times [2019-11-15 21:51:12,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:12,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120356264] [2019-11-15 21:51:12,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:12,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:12,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:13,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120356264] [2019-11-15 21:51:13,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:13,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:51:13,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827441609] [2019-11-15 21:51:13,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:51:13,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:13,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:51:13,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:51:13,006 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand 7 states. [2019-11-15 21:51:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:13,344 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2019-11-15 21:51:13,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:51:13,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-15 21:51:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:13,347 INFO L225 Difference]: With dead ends: 141 [2019-11-15 21:51:13,347 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 21:51:13,347 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 21:51:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 21:51:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128. [2019-11-15 21:51:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-15 21:51:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2019-11-15 21:51:13,354 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 21 [2019-11-15 21:51:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:13,355 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2019-11-15 21:51:13,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:51:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2019-11-15 21:51:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:51:13,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:13,357 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:13,357 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:13,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:13,358 INFO L82 PathProgramCache]: Analyzing trace with hash 725606813, now seen corresponding path program 1 times [2019-11-15 21:51:13,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:13,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232266392] [2019-11-15 21:51:13,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:13,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:13,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:13,455 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 21:51:13,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232266392] [2019-11-15 21:51:13,455 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:13,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:51:13,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922619102] [2019-11-15 21:51:13,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:51:13,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:13,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:51:13,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:51:13,457 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand 7 states. [2019-11-15 21:51:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:13,831 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2019-11-15 21:51:13,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:51:13,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-15 21:51:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:13,833 INFO L225 Difference]: With dead ends: 145 [2019-11-15 21:51:13,833 INFO L226 Difference]: Without dead ends: 145 [2019-11-15 21:51:13,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:51:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-15 21:51:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2019-11-15 21:51:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-15 21:51:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 154 transitions. [2019-11-15 21:51:13,837 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 154 transitions. Word has length 23 [2019-11-15 21:51:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:13,838 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 154 transitions. [2019-11-15 21:51:13,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:51:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2019-11-15 21:51:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 21:51:13,839 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:13,839 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:13,839 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:13,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1509133776, now seen corresponding path program 1 times [2019-11-15 21:51:13,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:13,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012220274] [2019-11-15 21:51:13,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:13,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:13,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:13,945 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 21:51:13,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012220274] [2019-11-15 21:51:13,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:13,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:51:13,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155800453] [2019-11-15 21:51:13,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:51:13,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:13,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:51:13,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:51:13,947 INFO L87 Difference]: Start difference. First operand 138 states and 154 transitions. Second operand 7 states. [2019-11-15 21:51:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:14,444 INFO L93 Difference]: Finished difference Result 190 states and 212 transitions. [2019-11-15 21:51:14,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:51:14,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-15 21:51:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:14,446 INFO L225 Difference]: With dead ends: 190 [2019-11-15 21:51:14,446 INFO L226 Difference]: Without dead ends: 190 [2019-11-15 21:51:14,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:51:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-15 21:51:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 136. [2019-11-15 21:51:14,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-15 21:51:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2019-11-15 21:51:14,452 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 25 [2019-11-15 21:51:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:14,452 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2019-11-15 21:51:14,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:51:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2019-11-15 21:51:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 21:51:14,458 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:14,458 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:14,458 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:14,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:14,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1509133775, now seen corresponding path program 1 times [2019-11-15 21:51:14,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:14,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045099293] [2019-11-15 21:51:14,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:14,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:14,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:14,561 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 21:51:14,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045099293] [2019-11-15 21:51:14,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:14,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:51:14,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48444412] [2019-11-15 21:51:14,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:51:14,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:14,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:51:14,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:51:14,563 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand 7 states. [2019-11-15 21:51:14,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:14,950 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2019-11-15 21:51:14,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:51:14,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-15 21:51:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:14,951 INFO L225 Difference]: With dead ends: 192 [2019-11-15 21:51:14,951 INFO L226 Difference]: Without dead ends: 192 [2019-11-15 21:51:14,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:51:14,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-15 21:51:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 135. [2019-11-15 21:51:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-15 21:51:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2019-11-15 21:51:14,957 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 25 [2019-11-15 21:51:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:14,957 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2019-11-15 21:51:14,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:51:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2019-11-15 21:51:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 21:51:14,958 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:14,958 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:14,959 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:14,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:14,959 INFO L82 PathProgramCache]: Analyzing trace with hash -126952135, now seen corresponding path program 1 times [2019-11-15 21:51:14,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:14,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72031893] [2019-11-15 21:51:14,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:14,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:14,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:15,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72031893] [2019-11-15 21:51:15,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008878388] [2019-11-15 21:51:15,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:15,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 21:51:15,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:15,420 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:15,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:51:15,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:15,458 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 21:51:15,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:15,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 21:51:15,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:15,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:15,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:15,520 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 21:51:15,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 21:51:15,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:15,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:51:15,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:15,664 INFO L567 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-11-15 21:51:15,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:15,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2019-11-15 21:51:15,757 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 21:51:15,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2019-11-15 21:51:15,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:15,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:15,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:15,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:51:15,791 INFO L567 ElimStorePlain]: treesize reduction 82, result has 29.9 percent of original size [2019-11-15 21:51:15,792 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 21:51:15,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-11-15 21:51:15,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:15,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-15 21:51:15,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:15,941 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-15 21:51:15,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:15,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-15 21:51:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:16,035 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:16,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-11-15 21:51:16,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922647659] [2019-11-15 21:51:16,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 21:51:16,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:16,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 21:51:16,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:51:16,037 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand 23 states. [2019-11-15 21:51:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:17,470 INFO L93 Difference]: Finished difference Result 222 states and 247 transitions. [2019-11-15 21:51:17,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:51:17,470 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2019-11-15 21:51:17,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:17,473 INFO L225 Difference]: With dead ends: 222 [2019-11-15 21:51:17,474 INFO L226 Difference]: Without dead ends: 222 [2019-11-15 21:51:17,474 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=787, Unknown=0, NotChecked=0, Total=992 [2019-11-15 21:51:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-15 21:51:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 152. [2019-11-15 21:51:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 21:51:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2019-11-15 21:51:17,482 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 28 [2019-11-15 21:51:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:17,483 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2019-11-15 21:51:17,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 21:51:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2019-11-15 21:51:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 21:51:17,484 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:17,485 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:17,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:17,689 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:17,689 INFO L82 PathProgramCache]: Analyzing trace with hash -126952134, now seen corresponding path program 1 times [2019-11-15 21:51:17,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:17,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958274148] [2019-11-15 21:51:17,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:17,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:17,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:17,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958274148] [2019-11-15 21:51:17,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433179930] [2019-11-15 21:51:17,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:18,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 21:51:18,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:18,131 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_59|], 1=[|v_#valid_69|]} [2019-11-15 21:51:18,134 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 21:51:18,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:18,167 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:18,168 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 21:51:18,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:18,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,184 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 21:51:18,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:18,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:18,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:18,232 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:18,246 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 21:51:18,246 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 21:51:18,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:18,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:51:18,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:18,391 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:18,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:51:18,392 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,443 INFO L567 ElimStorePlain]: treesize reduction 24, result has 61.3 percent of original size [2019-11-15 21:51:18,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:38 [2019-11-15 21:51:18,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:18,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2019-11-15 21:51:18,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:18,582 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 21:51:18,582 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 71 treesize of output 86 [2019-11-15 21:51:18,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:18,584 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,611 INFO L567 ElimStorePlain]: treesize reduction 32, result has 59.5 percent of original size [2019-11-15 21:51:18,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:18,612 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2019-11-15 21:51:18,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:18,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2019-11-15 21:51:18,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,732 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-15 21:51:18,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:51:18,738 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:18,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:18,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-15 21:51:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:18,764 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:18,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2019-11-15 21:51:18,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472954531] [2019-11-15 21:51:18,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 21:51:18,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:18,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:51:18,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:51:18,766 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand 18 states. [2019-11-15 21:51:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:19,981 INFO L93 Difference]: Finished difference Result 227 states and 253 transitions. [2019-11-15 21:51:19,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 21:51:19,982 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2019-11-15 21:51:19,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:19,983 INFO L225 Difference]: With dead ends: 227 [2019-11-15 21:51:19,983 INFO L226 Difference]: Without dead ends: 227 [2019-11-15 21:51:19,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2019-11-15 21:51:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-15 21:51:19,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 151. [2019-11-15 21:51:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-15 21:51:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 170 transitions. [2019-11-15 21:51:19,990 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 170 transitions. Word has length 28 [2019-11-15 21:51:19,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:19,991 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 170 transitions. [2019-11-15 21:51:19,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 21:51:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 170 transitions. [2019-11-15 21:51:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:51:19,994 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:19,994 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:20,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:20,198 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:20,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:20,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2063531018, now seen corresponding path program 1 times [2019-11-15 21:51:20,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:20,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550856262] [2019-11-15 21:51:20,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:20,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:20,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:20,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550856262] [2019-11-15 21:51:20,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932948789] [2019-11-15 21:51:20,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:20,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 21:51:20,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:20,661 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:20,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:51:20,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:20,686 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 21:51:20,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:20,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 21:51:20,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:20,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:20,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:20,723 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 21:51:20,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 21:51:20,823 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:20,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:51:20,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:20,853 INFO L567 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-11-15 21:51:20,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:20,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2019-11-15 21:51:20,938 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 21:51:20,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2019-11-15 21:51:20,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:20,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:20,953 INFO L567 ElimStorePlain]: treesize reduction 32, result has 51.5 percent of original size [2019-11-15 21:51:20,953 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 21:51:20,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-11-15 21:51:21,072 INFO L341 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2019-11-15 21:51:21,073 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 48 treesize of output 40 [2019-11-15 21:51:21,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:21,092 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.8 percent of original size [2019-11-15 21:51:21,092 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 21:51:21,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:34 [2019-11-15 21:51:21,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:21,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-15 21:51:21,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:21,126 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-15 21:51:21,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:21,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-15 21:51:21,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:21,159 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:21,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-15 21:51:21,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645015341] [2019-11-15 21:51:21,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 21:51:21,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:21,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 21:51:21,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-11-15 21:51:21,161 INFO L87 Difference]: Start difference. First operand 151 states and 170 transitions. Second operand 21 states. [2019-11-15 21:51:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:21,921 INFO L93 Difference]: Finished difference Result 220 states and 246 transitions. [2019-11-15 21:51:21,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 21:51:21,921 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-11-15 21:51:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:21,923 INFO L225 Difference]: With dead ends: 220 [2019-11-15 21:51:21,923 INFO L226 Difference]: Without dead ends: 220 [2019-11-15 21:51:21,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2019-11-15 21:51:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-15 21:51:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 158. [2019-11-15 21:51:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 21:51:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 179 transitions. [2019-11-15 21:51:21,935 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 179 transitions. Word has length 30 [2019-11-15 21:51:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:21,936 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 179 transitions. [2019-11-15 21:51:21,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 21:51:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 179 transitions. [2019-11-15 21:51:21,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:51:21,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:21,937 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:22,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:22,138 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:22,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:22,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2063531019, now seen corresponding path program 1 times [2019-11-15 21:51:22,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:22,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411189860] [2019-11-15 21:51:22,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:22,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:22,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:22,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411189860] [2019-11-15 21:51:22,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623510783] [2019-11-15 21:51:22,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:22,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-15 21:51:22,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:22,493 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_60|], 1=[|v_#valid_71|]} [2019-11-15 21:51:22,502 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 21:51:22,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:22,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:22,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:22,534 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 21:51:22,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:22,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:22,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:22,548 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 21:51:22,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:22,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:22,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:22,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:22,587 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:22,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:22,603 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 21:51:22,604 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 21:51:22,719 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:22,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:51:22,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:22,771 INFO L567 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2019-11-15 21:51:22,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:51:22,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:22,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:22,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:22,792 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:38 [2019-11-15 21:51:22,868 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 21:51:22,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 105 [2019-11-15 21:51:22,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:22,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:22,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:22,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:51:22,918 INFO L567 ElimStorePlain]: treesize reduction 166, result has 32.2 percent of original size [2019-11-15 21:51:22,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:22,931 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 78 treesize of output 53 [2019-11-15 21:51:22,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:22,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:22,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:22,945 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2019-11-15 21:51:23,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:23,081 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-15 21:51:23,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 59 [2019-11-15 21:51:23,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:23,113 INFO L567 ElimStorePlain]: treesize reduction 34, result has 66.0 percent of original size [2019-11-15 21:51:23,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:23,117 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 38 treesize of output 25 [2019-11-15 21:51:23,118 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:23,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:23,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:23,128 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:47 [2019-11-15 21:51:23,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:23,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2019-11-15 21:51:23,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:23,164 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-15 21:51:23,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:51:23,175 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:23,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:23,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:23,183 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-15 21:51:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:23,213 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:23,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-15 21:51:23,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137779110] [2019-11-15 21:51:23,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 21:51:23,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:23,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 21:51:23,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:51:23,215 INFO L87 Difference]: Start difference. First operand 158 states and 179 transitions. Second operand 17 states. [2019-11-15 21:51:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:24,329 INFO L93 Difference]: Finished difference Result 219 states and 245 transitions. [2019-11-15 21:51:24,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:51:24,330 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-15 21:51:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:24,331 INFO L225 Difference]: With dead ends: 219 [2019-11-15 21:51:24,331 INFO L226 Difference]: Without dead ends: 219 [2019-11-15 21:51:24,332 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-11-15 21:51:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-15 21:51:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 158. [2019-11-15 21:51:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 21:51:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2019-11-15 21:51:24,337 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 30 [2019-11-15 21:51:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:24,337 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2019-11-15 21:51:24,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 21:51:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2019-11-15 21:51:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:51:24,338 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:24,338 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:24,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:24,542 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:24,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:24,542 INFO L82 PathProgramCache]: Analyzing trace with hash -6595669, now seen corresponding path program 1 times [2019-11-15 21:51:24,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:24,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715874402] [2019-11-15 21:51:24,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:24,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:24,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:24,645 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 21:51:24,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715874402] [2019-11-15 21:51:24,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:24,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:51:24,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942062784] [2019-11-15 21:51:24,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:51:24,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:24,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:51:24,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:51:24,647 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand 7 states. [2019-11-15 21:51:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:25,015 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2019-11-15 21:51:25,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:51:25,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-11-15 21:51:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:25,016 INFO L225 Difference]: With dead ends: 191 [2019-11-15 21:51:25,016 INFO L226 Difference]: Without dead ends: 191 [2019-11-15 21:51:25,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:51:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-15 21:51:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 158. [2019-11-15 21:51:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 21:51:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 177 transitions. [2019-11-15 21:51:25,022 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 177 transitions. Word has length 31 [2019-11-15 21:51:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:25,022 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 177 transitions. [2019-11-15 21:51:25,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:51:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 177 transitions. [2019-11-15 21:51:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:51:25,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:25,024 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:25,024 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:25,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:25,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1774054508, now seen corresponding path program 1 times [2019-11-15 21:51:25,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:25,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998236736] [2019-11-15 21:51:25,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:25,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:25,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:25,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998236736] [2019-11-15 21:51:25,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307542860] [2019-11-15 21:51:25,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:25,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 21:51:25,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:25,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:25,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:51:25,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:25,490 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 21:51:25,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:25,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 21:51:25,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:25,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:25,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:25,547 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 21:51:25,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 21:51:25,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:25,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:51:25,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:25,662 INFO L567 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-11-15 21:51:25,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:25,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2019-11-15 21:51:25,733 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 21:51:25,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2019-11-15 21:51:25,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:25,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:25,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:25,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:51:25,791 INFO L567 ElimStorePlain]: treesize reduction 82, result has 29.9 percent of original size [2019-11-15 21:51:25,791 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 21:51:25,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-11-15 21:51:25,859 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:25,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-11-15 21:51:25,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:25,872 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-15 21:51:25,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:25,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-15 21:51:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:25,955 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:25,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2019-11-15 21:51:25,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670383921] [2019-11-15 21:51:25,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 21:51:25,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 21:51:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2019-11-15 21:51:25,957 INFO L87 Difference]: Start difference. First operand 158 states and 177 transitions. Second operand 25 states. [2019-11-15 21:51:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:27,007 INFO L93 Difference]: Finished difference Result 245 states and 270 transitions. [2019-11-15 21:51:27,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 21:51:27,007 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2019-11-15 21:51:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:27,008 INFO L225 Difference]: With dead ends: 245 [2019-11-15 21:51:27,008 INFO L226 Difference]: Without dead ends: 245 [2019-11-15 21:51:27,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 21:51:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-15 21:51:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 186. [2019-11-15 21:51:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-15 21:51:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 210 transitions. [2019-11-15 21:51:27,015 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 210 transitions. Word has length 34 [2019-11-15 21:51:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:27,015 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 210 transitions. [2019-11-15 21:51:27,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 21:51:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2019-11-15 21:51:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:51:27,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:27,017 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:27,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:27,234 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:27,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:27,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1774054507, now seen corresponding path program 1 times [2019-11-15 21:51:27,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:27,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930232265] [2019-11-15 21:51:27,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:27,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:27,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:27,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930232265] [2019-11-15 21:51:27,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793133024] [2019-11-15 21:51:27,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:27,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 21:51:27,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:27,613 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_61|], 1=[|v_#valid_73|]} [2019-11-15 21:51:27,616 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 21:51:27,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:27,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:27,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:27,640 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 21:51:27,641 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:27,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:27,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:27,651 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 21:51:27,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:27,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:27,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:27,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:27,674 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:27,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:27,685 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 21:51:27,685 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 21:51:27,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:27,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:51:27,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:27,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:27,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:27,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:51:27,777 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:27,800 INFO L567 ElimStorePlain]: treesize reduction 24, result has 61.3 percent of original size [2019-11-15 21:51:27,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:27,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:38 [2019-11-15 21:51:27,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:27,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2019-11-15 21:51:27,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:27,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:27,887 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 21:51:27,888 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 71 treesize of output 86 [2019-11-15 21:51:27,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:27,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:27,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:27,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 21:51:27,916 INFO L567 ElimStorePlain]: treesize reduction 104, result has 31.6 percent of original size [2019-11-15 21:51:27,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:27,917 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2019-11-15 21:51:27,984 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:27,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2019-11-15 21:51:27,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:28,005 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-15 21:51:28,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:51:28,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:28,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:28,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:28,034 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-15 21:51:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:28,054 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:28,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2019-11-15 21:51:28,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471860159] [2019-11-15 21:51:28,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 21:51:28,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:28,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 21:51:28,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-11-15 21:51:28,059 INFO L87 Difference]: Start difference. First operand 186 states and 210 transitions. Second operand 19 states. [2019-11-15 21:51:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:29,212 INFO L93 Difference]: Finished difference Result 241 states and 268 transitions. [2019-11-15 21:51:29,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 21:51:29,213 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2019-11-15 21:51:29,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:29,214 INFO L225 Difference]: With dead ends: 241 [2019-11-15 21:51:29,214 INFO L226 Difference]: Without dead ends: 241 [2019-11-15 21:51:29,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2019-11-15 21:51:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-15 21:51:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 185. [2019-11-15 21:51:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-15 21:51:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2019-11-15 21:51:29,219 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 34 [2019-11-15 21:51:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:29,220 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2019-11-15 21:51:29,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 21:51:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2019-11-15 21:51:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:51:29,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:29,222 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:29,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:29,426 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:29,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:29,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2083794390, now seen corresponding path program 2 times [2019-11-15 21:51:29,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:29,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590343839] [2019-11-15 21:51:29,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:29,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:29,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:29,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590343839] [2019-11-15 21:51:29,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891829937] [2019-11-15 21:51:29,753 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:29,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:51:29,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:51:29,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 21:51:29,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:30,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:30,007 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 21:51:30,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:30,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:30,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:30,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 21:51:30,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:30,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:30,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:30,074 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 21:51:30,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-15 21:51:30,232 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:30,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-15 21:51:30,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:30,254 INFO L567 ElimStorePlain]: treesize reduction 24, result has 52.9 percent of original size [2019-11-15 21:51:30,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:30,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2019-11-15 21:51:30,296 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 21:51:30,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:51:30,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:30,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:30,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:30,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2019-11-15 21:51:30,317 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:30,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 21:51:30,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:30,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:30,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:30,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2019-11-15 21:51:30,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:51:30,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:30,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:30,386 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 21:51:30,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2019-11-15 21:51:30,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:30,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 101 [2019-11-15 21:51:30,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:30,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:30,584 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 21:51:30,630 INFO L567 ElimStorePlain]: treesize reduction 52, result has 46.9 percent of original size [2019-11-15 21:51:30,630 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 21:51:30,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2019-11-15 21:51:30,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:30,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:30,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 94 [2019-11-15 21:51:30,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:30,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:30,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:30,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 166 [2019-11-15 21:51:30,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:30,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:30,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:30,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:30,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:30,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:30,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:30,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:30,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:30,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:31,102 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 29 [2019-11-15 21:51:31,102 INFO L567 ElimStorePlain]: treesize reduction 2616, result has 3.1 percent of original size [2019-11-15 21:51:31,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 21:51:31,103 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:155, output treesize:81 [2019-11-15 21:51:31,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:31,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:31,317 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:51:31,318 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:51:31,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:31,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 37 [2019-11-15 21:51:31,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:31,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:51:31,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:31,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 68 [2019-11-15 21:51:31,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:31,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:31,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:31,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:31,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:31,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:31,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:31,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:31,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:31,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:31,365 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:31,394 INFO L567 ElimStorePlain]: treesize reduction 69, result has 18.8 percent of original size [2019-11-15 21:51:31,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:31,397 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:101, output treesize:5 [2019-11-15 21:51:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:31,407 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:31,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2019-11-15 21:51:31,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268706699] [2019-11-15 21:51:31,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 21:51:31,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:31,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 21:51:31,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=871, Unknown=1, NotChecked=0, Total=992 [2019-11-15 21:51:31,408 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand 32 states. [2019-11-15 21:51:32,030 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2019-11-15 21:51:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:34,061 INFO L93 Difference]: Finished difference Result 277 states and 306 transitions. [2019-11-15 21:51:34,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 21:51:34,063 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 35 [2019-11-15 21:51:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:34,065 INFO L225 Difference]: With dead ends: 277 [2019-11-15 21:51:34,065 INFO L226 Difference]: Without dead ends: 277 [2019-11-15 21:51:34,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=395, Invalid=2150, Unknown=5, NotChecked=0, Total=2550 [2019-11-15 21:51:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-15 21:51:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 202. [2019-11-15 21:51:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-11-15 21:51:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 229 transitions. [2019-11-15 21:51:34,072 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 229 transitions. Word has length 35 [2019-11-15 21:51:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:34,073 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 229 transitions. [2019-11-15 21:51:34,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 21:51:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 229 transitions. [2019-11-15 21:51:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:51:34,074 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:34,074 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:34,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:34,278 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:34,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2083794389, now seen corresponding path program 2 times [2019-11-15 21:51:34,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:34,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826123016] [2019-11-15 21:51:34,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:34,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:34,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:34,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826123016] [2019-11-15 21:51:34,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282105356] [2019-11-15 21:51:34,623 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:34,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:51:34,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:51:34,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 21:51:34,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:34,865 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:34,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:51:34,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:34,891 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 21:51:34,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:34,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 21:51:34,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:34,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:34,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:34,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:34,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:34,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:34,969 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 21:51:34,969 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-15 21:51:35,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:35,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:51:35,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:35,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:35,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:35,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:51:35,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:35,175 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2019-11-15 21:51:35,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:35,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2019-11-15 21:51:35,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:35,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:51:35,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:35,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:35,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:35,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:51:35,251 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:35,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:35,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:35,267 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-15 21:51:35,280 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:35,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 21:51:35,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:35,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:35,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:35,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2019-11-15 21:51:35,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:51:35,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:35,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:35,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:51:35,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:35,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:35,419 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 21:51:35,419 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:48 [2019-11-15 21:51:35,614 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_50|], 6=[|v_#memory_$Pointer$.base_66|]} [2019-11-15 21:51:35,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:35,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:51:35,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:35,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:35,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:35,705 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 70 treesize of output 107 [2019-11-15 21:51:35,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:35,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:35,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:35,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:35,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:35,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:35,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:35,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:35,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:35,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:35,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:35,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:35,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:35,715 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:35,812 INFO L567 ElimStorePlain]: treesize reduction 60, result has 50.4 percent of original size [2019-11-15 21:51:35,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:35,814 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:70 [2019-11-15 21:51:35,936 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_51|], 12=[|v_#memory_$Pointer$.base_67|]} [2019-11-15 21:51:35,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:35,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-11-15 21:51:35,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:35,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:36,153 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-11-15 21:51:36,153 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-15 21:51:36,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 152 [2019-11-15 21:51:36,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:36,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,158 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 21:51:36,250 INFO L567 ElimStorePlain]: treesize reduction 412, result has 18.3 percent of original size [2019-11-15 21:51:36,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:36,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:177, output treesize:91 [2019-11-15 21:51:36,471 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2019-11-15 21:51:36,476 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:51:36,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-15 21:51:36,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:36,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:36,521 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:51:36,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:36,575 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 70 treesize of output 95 [2019-11-15 21:51:36,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:36,586 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:36,641 INFO L567 ElimStorePlain]: treesize reduction 60, result has 34.8 percent of original size [2019-11-15 21:51:36,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:36,642 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:108, output treesize:9 [2019-11-15 21:51:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:36,756 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:36,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2019-11-15 21:51:36,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258857960] [2019-11-15 21:51:36,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 21:51:36,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:36,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 21:51:36,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1000, Unknown=6, NotChecked=0, Total=1122 [2019-11-15 21:51:36,758 INFO L87 Difference]: Start difference. First operand 202 states and 229 transitions. Second operand 34 states. [2019-11-15 21:51:37,478 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-11-15 21:51:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:41,160 INFO L93 Difference]: Finished difference Result 315 states and 351 transitions. [2019-11-15 21:51:41,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 21:51:41,161 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2019-11-15 21:51:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:41,162 INFO L225 Difference]: With dead ends: 315 [2019-11-15 21:51:41,162 INFO L226 Difference]: Without dead ends: 315 [2019-11-15 21:51:41,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=466, Invalid=2950, Unknown=6, NotChecked=0, Total=3422 [2019-11-15 21:51:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-15 21:51:41,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 197. [2019-11-15 21:51:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-15 21:51:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 223 transitions. [2019-11-15 21:51:41,168 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 223 transitions. Word has length 35 [2019-11-15 21:51:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:41,168 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 223 transitions. [2019-11-15 21:51:41,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 21:51:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 223 transitions. [2019-11-15 21:51:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:51:41,168 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:41,168 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:41,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:41,369 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:41,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:41,370 INFO L82 PathProgramCache]: Analyzing trace with hash 235589346, now seen corresponding path program 1 times [2019-11-15 21:51:41,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:41,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27579417] [2019-11-15 21:51:41,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:41,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:41,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:41,459 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 21:51:41,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27579417] [2019-11-15 21:51:41,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282766458] [2019-11-15 21:51:41,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:41,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 21:51:41,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:41,666 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 21:51:41,668 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:41,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2019-11-15 21:51:41,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221019563] [2019-11-15 21:51:41,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:51:41,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:41,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:51:41,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:51:41,670 INFO L87 Difference]: Start difference. First operand 197 states and 223 transitions. Second operand 8 states. [2019-11-15 21:51:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:42,069 INFO L93 Difference]: Finished difference Result 246 states and 274 transitions. [2019-11-15 21:51:42,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:51:42,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-11-15 21:51:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:42,071 INFO L225 Difference]: With dead ends: 246 [2019-11-15 21:51:42,071 INFO L226 Difference]: Without dead ends: 246 [2019-11-15 21:51:42,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:51:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-15 21:51:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 200. [2019-11-15 21:51:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-15 21:51:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 230 transitions. [2019-11-15 21:51:42,076 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 230 transitions. Word has length 36 [2019-11-15 21:51:42,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:42,076 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 230 transitions. [2019-11-15 21:51:42,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:51:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 230 transitions. [2019-11-15 21:51:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:51:42,077 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:42,077 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:42,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:42,281 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:42,281 INFO L82 PathProgramCache]: Analyzing trace with hash 235589347, now seen corresponding path program 1 times [2019-11-15 21:51:42,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:42,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206112953] [2019-11-15 21:51:42,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:42,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:42,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:42,506 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 21:51:42,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206112953] [2019-11-15 21:51:42,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564904830] [2019-11-15 21:51:42,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:42,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 21:51:42,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:42,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:42,756 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 14 treesize of output 16 [2019-11-15 21:51:42,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:42,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:42,785 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:42,786 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 21:51:42,786 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:42,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:42,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:42,796 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-11-15 21:51:42,922 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 21:51:42,922 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:42,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 20 [2019-11-15 21:51:42,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523166362] [2019-11-15 21:51:42,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 21:51:42,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:42,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 21:51:42,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:51:42,924 INFO L87 Difference]: Start difference. First operand 200 states and 230 transitions. Second operand 20 states. [2019-11-15 21:51:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:44,951 INFO L93 Difference]: Finished difference Result 305 states and 341 transitions. [2019-11-15 21:51:44,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 21:51:44,953 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-15 21:51:44,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:44,955 INFO L225 Difference]: With dead ends: 305 [2019-11-15 21:51:44,955 INFO L226 Difference]: Without dead ends: 305 [2019-11-15 21:51:44,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=324, Invalid=1316, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 21:51:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-15 21:51:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 240. [2019-11-15 21:51:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-11-15 21:51:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 289 transitions. [2019-11-15 21:51:44,962 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 289 transitions. Word has length 36 [2019-11-15 21:51:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:44,963 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 289 transitions. [2019-11-15 21:51:44,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 21:51:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 289 transitions. [2019-11-15 21:51:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:51:44,963 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:44,964 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:45,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:45,168 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:45,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:45,168 INFO L82 PathProgramCache]: Analyzing trace with hash 530881479, now seen corresponding path program 3 times [2019-11-15 21:51:45,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:45,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157544400] [2019-11-15 21:51:45,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:45,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:45,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:45,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:45,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157544400] [2019-11-15 21:51:45,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142220095] [2019-11-15 21:51:45,529 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:45,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 21:51:45,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:51:45,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-15 21:51:45,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:45,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:45,847 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 21:51:45,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:45,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:45,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:45,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 21:51:45,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:45,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:45,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:45,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:45,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:45,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:45,963 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 21:51:45,963 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-11-15 21:51:46,059 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:51:46,068 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:46,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 38 [2019-11-15 21:51:46,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,097 INFO L567 ElimStorePlain]: treesize reduction 16, result has 74.6 percent of original size [2019-11-15 21:51:46,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:51:46,100 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:46,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:43 [2019-11-15 21:51:46,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:46,164 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:46,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 98 [2019-11-15 21:51:46,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,192 INFO L567 ElimStorePlain]: treesize reduction 16, result has 84.6 percent of original size [2019-11-15 21:51:46,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:46,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 95 [2019-11-15 21:51:46,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,228 INFO L567 ElimStorePlain]: treesize reduction 58, result has 45.8 percent of original size [2019-11-15 21:51:46,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,228 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:127, output treesize:49 [2019-11-15 21:51:46,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:51:46,551 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:51:46,561 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:46,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 35 [2019-11-15 21:51:46,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:46,582 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 21:51:46,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:80, output treesize:46 [2019-11-15 21:51:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:46,758 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:46,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-11-15 21:51:46,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363462100] [2019-11-15 21:51:46,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 21:51:46,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:46,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 21:51:46,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2019-11-15 21:51:46,760 INFO L87 Difference]: Start difference. First operand 240 states and 289 transitions. Second operand 31 states. [2019-11-15 21:51:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:48,978 INFO L93 Difference]: Finished difference Result 275 states and 323 transitions. [2019-11-15 21:51:48,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:51:48,978 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 36 [2019-11-15 21:51:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:48,980 INFO L225 Difference]: With dead ends: 275 [2019-11-15 21:51:48,980 INFO L226 Difference]: Without dead ends: 275 [2019-11-15 21:51:48,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=262, Invalid=1718, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 21:51:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-15 21:51:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 247. [2019-11-15 21:51:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-15 21:51:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 296 transitions. [2019-11-15 21:51:48,988 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 296 transitions. Word has length 36 [2019-11-15 21:51:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:48,988 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 296 transitions. [2019-11-15 21:51:48,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 21:51:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 296 transitions. [2019-11-15 21:51:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 21:51:48,990 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:48,990 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:49,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:49,194 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:49,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:49,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1561167685, now seen corresponding path program 2 times [2019-11-15 21:51:49,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:49,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468197671] [2019-11-15 21:51:49,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:49,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:49,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:49,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468197671] [2019-11-15 21:51:49,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986956687] [2019-11-15 21:51:49,492 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:49,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:51:49,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:51:49,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 21:51:49,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:49,765 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:49,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:51:49,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:49,791 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-15 21:51:49,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:49,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-15 21:51:49,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:49,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:49,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:49,850 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 21:51:49,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-11-15 21:51:49,962 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:49,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:51:49,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:49,987 INFO L567 ElimStorePlain]: treesize reduction 24, result has 57.1 percent of original size [2019-11-15 21:51:49,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:49,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:32 [2019-11-15 21:51:50,032 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 21:51:50,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:51:50,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:50,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:50,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:50,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:32 [2019-11-15 21:51:50,067 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:50,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 21:51:50,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:50,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:50,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:50,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2019-11-15 21:51:50,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:51:50,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:50,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:50,129 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 21:51:50,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:36 [2019-11-15 21:51:50,284 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:50,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 105 [2019-11-15 21:51:50,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:50,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:50,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,290 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 21:51:50,342 INFO L567 ElimStorePlain]: treesize reduction 60, result has 41.2 percent of original size [2019-11-15 21:51:50,343 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 21:51:50,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:51 [2019-11-15 21:51:50,501 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-11-15 21:51:50,502 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-15 21:51:50,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 143 [2019-11-15 21:51:50,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:50,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:50,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:50,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:50,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-11-15 21:51:50,606 INFO L567 ElimStorePlain]: treesize reduction 905, result has 6.7 percent of original size [2019-11-15 21:51:50,606 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 21:51:50,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:107, output treesize:64 [2019-11-15 21:51:50,898 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 21:51:50,899 INFO L341 Elim1Store]: treesize reduction 68, result has 55.3 percent of original size [2019-11-15 21:51:50,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 110 [2019-11-15 21:51:50,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,910 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 21:51:50,952 INFO L567 ElimStorePlain]: treesize reduction 44, result has 54.6 percent of original size [2019-11-15 21:51:50,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:50,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:53 [2019-11-15 21:51:50,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:50,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,085 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:51:51,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:51,122 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 68 treesize of output 93 [2019-11-15 21:51:51,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:51,134 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 21:51:51,185 INFO L567 ElimStorePlain]: treesize reduction 60, result has 28.6 percent of original size [2019-11-15 21:51:51,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:51,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:74, output treesize:5 [2019-11-15 21:51:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:51,201 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:51,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2019-11-15 21:51:51,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764389875] [2019-11-15 21:51:51,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 21:51:51,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:51,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 21:51:51,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=920, Unknown=3, NotChecked=0, Total=1056 [2019-11-15 21:51:51,203 INFO L87 Difference]: Start difference. First operand 247 states and 296 transitions. Second operand 33 states. [2019-11-15 21:51:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:53,409 INFO L93 Difference]: Finished difference Result 318 states and 370 transitions. [2019-11-15 21:51:53,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 21:51:53,409 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 37 [2019-11-15 21:51:53,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:53,411 INFO L225 Difference]: With dead ends: 318 [2019-11-15 21:51:53,412 INFO L226 Difference]: Without dead ends: 318 [2019-11-15 21:51:53,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=397, Invalid=2352, Unknown=7, NotChecked=0, Total=2756 [2019-11-15 21:51:53,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-15 21:51:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 254. [2019-11-15 21:51:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:51:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 305 transitions. [2019-11-15 21:51:53,419 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 305 transitions. Word has length 37 [2019-11-15 21:51:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:53,420 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 305 transitions. [2019-11-15 21:51:53,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 21:51:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 305 transitions. [2019-11-15 21:51:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 21:51:53,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:53,421 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:53,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:53,630 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:53,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1561167684, now seen corresponding path program 2 times [2019-11-15 21:51:53,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:53,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369572419] [2019-11-15 21:51:53,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:53,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:53,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:53,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369572419] [2019-11-15 21:51:53,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351274995] [2019-11-15 21:51:53,981 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:54,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:51:54,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:51:54,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 21:51:54,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:54,221 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_63|], 3=[|v_#valid_82|]} [2019-11-15 21:51:54,227 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 21:51:54,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:54,262 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:54,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:51:54,263 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,307 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-15 21:51:54,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,307 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-11-15 21:51:54,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:54,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,389 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.4 percent of original size [2019-11-15 21:51:54,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:54,392 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:54,406 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 21:51:54,406 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:48 [2019-11-15 21:51:54,533 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:54,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 56 [2019-11-15 21:51:54,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,567 INFO L567 ElimStorePlain]: treesize reduction 24, result has 69.6 percent of original size [2019-11-15 21:51:54,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:51:54,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:54,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,598 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:51 [2019-11-15 21:51:54,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:54,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:51:54,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:54,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:54,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:51:54,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:54,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,688 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:51 [2019-11-15 21:51:54,693 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_64|], 3=[|v_#valid_83|]} [2019-11-15 21:51:54,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:54,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 21:51:54,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:54,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:54,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 21:51:54,733 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:54,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,750 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2019-11-15 21:51:54,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:51:54,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:54,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:51:54,849 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:54,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:54,867 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 21:51:54,867 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-11-15 21:51:54,995 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_59|], 6=[|v_#memory_$Pointer$.base_82|]} [2019-11-15 21:51:54,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:55,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:51:55,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:55,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:55,059 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:55,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 110 [2019-11-15 21:51:55,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:55,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:55,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,067 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:55,139 INFO L567 ElimStorePlain]: treesize reduction 60, result has 50.4 percent of original size [2019-11-15 21:51:55,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:55,140 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:70 [2019-11-15 21:51:55,195 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_60|], 12=[|v_#memory_$Pointer$.base_83|]} [2019-11-15 21:51:55,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:55,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-11-15 21:51:55,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:55,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:55,346 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-11-15 21:51:55,347 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-15 21:51:55,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 155 [2019-11-15 21:51:55,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:55,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:55,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:55,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:51:55,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 21:51:55,541 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-11-15 21:51:55,541 INFO L567 ElimStorePlain]: treesize reduction 1129, result has 8.1 percent of original size [2019-11-15 21:51:55,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:55,542 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:185, output treesize:99 [2019-11-15 21:51:55,697 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_61|], 12=[|v_#memory_$Pointer$.base_84|]} [2019-11-15 21:51:55,727 INFO L341 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2019-11-15 21:51:55,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2019-11-15 21:51:55,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:55,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:55,860 INFO L341 Elim1Store]: treesize reduction 68, result has 55.3 percent of original size [2019-11-15 21:51:55,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 122 [2019-11-15 21:51:55,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,872 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 21:51:55,947 INFO L567 ElimStorePlain]: treesize reduction 56, result has 56.6 percent of original size [2019-11-15 21:51:55,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:55,949 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:137, output treesize:86 [2019-11-15 21:51:55,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:55,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,102 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2019-11-15 21:51:56,107 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:51:56,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-15 21:51:56,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:56,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:56,140 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:51:56,174 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:56,174 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 81 treesize of output 98 [2019-11-15 21:51:56,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:51:56,184 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:56,219 INFO L567 ElimStorePlain]: treesize reduction 60, result has 34.8 percent of original size [2019-11-15 21:51:56,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:51:56,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:116, output treesize:18 [2019-11-15 21:51:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:56,268 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:51:56,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 33 [2019-11-15 21:51:56,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257447748] [2019-11-15 21:51:56,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 21:51:56,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:51:56,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 21:51:56,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=971, Unknown=6, NotChecked=0, Total=1122 [2019-11-15 21:51:56,270 INFO L87 Difference]: Start difference. First operand 254 states and 305 transitions. Second operand 34 states. [2019-11-15 21:51:58,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:58,823 INFO L93 Difference]: Finished difference Result 320 states and 372 transitions. [2019-11-15 21:51:58,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 21:51:58,824 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 37 [2019-11-15 21:51:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:58,826 INFO L225 Difference]: With dead ends: 320 [2019-11-15 21:51:58,826 INFO L226 Difference]: Without dead ends: 320 [2019-11-15 21:51:58,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=378, Invalid=2162, Unknown=10, NotChecked=0, Total=2550 [2019-11-15 21:51:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-15 21:51:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 247. [2019-11-15 21:51:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-15 21:51:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 296 transitions. [2019-11-15 21:51:58,833 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 296 transitions. Word has length 37 [2019-11-15 21:51:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:58,834 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 296 transitions. [2019-11-15 21:51:58,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 21:51:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 296 transitions. [2019-11-15 21:51:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:51:58,835 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:58,835 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:59,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:51:59,039 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:51:59,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:59,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1909637373, now seen corresponding path program 2 times [2019-11-15 21:51:59,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:51:59,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141822414] [2019-11-15 21:51:59,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:59,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:51:59,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:51:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:51:59,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141822414] [2019-11-15 21:51:59,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534179977] [2019-11-15 21:51:59,397 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:51:59,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:51:59,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:51:59,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-15 21:51:59,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:59,700 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:59,701 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 21:51:59,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:59,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:59,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:59,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-15 21:51:59,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:59,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:59,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:59,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:51:59,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:59,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:59,802 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 21:51:59,802 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:21 [2019-11-15 21:52:00,010 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:00,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-15 21:52:00,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:00,063 INFO L567 ElimStorePlain]: treesize reduction 24, result has 65.7 percent of original size [2019-11-15 21:52:00,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:00,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:00,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:00,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:00,088 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:42 [2019-11-15 21:52:00,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:00,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 123 [2019-11-15 21:52:00,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:00,239 INFO L567 ElimStorePlain]: treesize reduction 58, result has 60.0 percent of original size [2019-11-15 21:52:00,308 INFO L341 Elim1Store]: treesize reduction 66, result has 49.6 percent of original size [2019-11-15 21:52:00,308 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 78 treesize of output 109 [2019-11-15 21:52:00,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:00,310 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:00,343 INFO L567 ElimStorePlain]: treesize reduction 40, result has 54.5 percent of original size [2019-11-15 21:52:00,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:00,344 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:48 [2019-11-15 21:52:00,655 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:00,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2019-11-15 21:52:00,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:00,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:00,687 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:00,729 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:00,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 71 [2019-11-15 21:52:00,730 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:00,802 INFO L567 ElimStorePlain]: treesize reduction 36, result has 55.6 percent of original size [2019-11-15 21:52:00,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:00,803 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:87, output treesize:15 [2019-11-15 21:52:00,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 21:52:00,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:00,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:00,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 21:52:00,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:00,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:00,825 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 21:52:00,825 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-15 21:52:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:00,835 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:00,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 32 [2019-11-15 21:52:00,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031925828] [2019-11-15 21:52:00,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-15 21:52:00,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:00,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-15 21:52:00,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2019-11-15 21:52:00,837 INFO L87 Difference]: Start difference. First operand 247 states and 296 transitions. Second operand 32 states. [2019-11-15 21:52:02,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:02,800 INFO L93 Difference]: Finished difference Result 312 states and 367 transitions. [2019-11-15 21:52:02,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 21:52:02,801 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2019-11-15 21:52:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:02,803 INFO L225 Difference]: With dead ends: 312 [2019-11-15 21:52:02,803 INFO L226 Difference]: Without dead ends: 312 [2019-11-15 21:52:02,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=315, Invalid=2441, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 21:52:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-15 21:52:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 249. [2019-11-15 21:52:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-15 21:52:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 298 transitions. [2019-11-15 21:52:02,810 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 298 transitions. Word has length 39 [2019-11-15 21:52:02,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:02,810 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 298 transitions. [2019-11-15 21:52:02,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-15 21:52:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 298 transitions. [2019-11-15 21:52:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:52:02,811 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:02,811 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:03,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:03,016 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:52:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:03,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1408222012, now seen corresponding path program 1 times [2019-11-15 21:52:03,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:03,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514146596] [2019-11-15 21:52:03,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:03,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:03,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:03,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514146596] [2019-11-15 21:52:03,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726174961] [2019-11-15 21:52:03,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:52:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:03,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 21:52:03,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:03,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:03,514 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 21:52:03,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:03,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:03,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:03,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 21:52:03,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:03,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:03,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:03,537 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 21:52:03,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-11-15 21:52:03,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:03,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:03,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:03,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:03,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 21:52:03,693 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 21:52:03,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 74 [2019-11-15 21:52:03,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:03,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:03,704 INFO L567 ElimStorePlain]: treesize reduction 32, result has 38.5 percent of original size [2019-11-15 21:52:03,704 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 21:52:03,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2019-11-15 21:52:03,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:03,817 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-15 21:52:03,817 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 39 treesize of output 47 [2019-11-15 21:52:03,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:03,835 INFO L567 ElimStorePlain]: treesize reduction 34, result has 43.3 percent of original size [2019-11-15 21:52:03,835 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 21:52:03,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:26 [2019-11-15 21:52:03,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:03,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 117 [2019-11-15 21:52:03,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:03,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:03,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:03,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:03,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:52:03,953 INFO L567 ElimStorePlain]: treesize reduction 235, result has 13.0 percent of original size [2019-11-15 21:52:03,953 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 21:52:03,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:18 [2019-11-15 21:52:04,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 21:52:04,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:04,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:04,006 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 21:52:04,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-11-15 21:52:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:04,014 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:04,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 22 [2019-11-15 21:52:04,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727528894] [2019-11-15 21:52:04,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 21:52:04,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:04,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 21:52:04,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:52:04,016 INFO L87 Difference]: Start difference. First operand 249 states and 298 transitions. Second operand 23 states. [2019-11-15 21:52:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:05,456 INFO L93 Difference]: Finished difference Result 340 states and 398 transitions. [2019-11-15 21:52:05,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 21:52:05,457 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-15 21:52:05,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:05,458 INFO L225 Difference]: With dead ends: 340 [2019-11-15 21:52:05,458 INFO L226 Difference]: Without dead ends: 340 [2019-11-15 21:52:05,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=280, Invalid=1442, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 21:52:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-15 21:52:05,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 265. [2019-11-15 21:52:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-15 21:52:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 317 transitions. [2019-11-15 21:52:05,465 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 317 transitions. Word has length 39 [2019-11-15 21:52:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:05,465 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 317 transitions. [2019-11-15 21:52:05,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 21:52:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 317 transitions. [2019-11-15 21:52:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 21:52:05,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:05,466 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:05,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:05,670 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:52:05,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:05,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1408222011, now seen corresponding path program 1 times [2019-11-15 21:52:05,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:05,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835781821] [2019-11-15 21:52:05,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:05,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:05,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:06,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835781821] [2019-11-15 21:52:06,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133485829] [2019-11-15 21:52:06,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:52:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:06,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-15 21:52:06,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:06,193 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:06,193 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 21:52:06,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:06,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 21:52:06,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:06,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:06,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:06,241 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:06,250 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 21:52:06,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-11-15 21:52:06,353 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:06,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 46 [2019-11-15 21:52:06,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,378 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2019-11-15 21:52:06,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:06,381 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:06,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,390 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2019-11-15 21:52:06,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:06,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2019-11-15 21:52:06,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:06,482 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 21:52:06,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 81 [2019-11-15 21:52:06,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:06,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,499 INFO L567 ElimStorePlain]: treesize reduction 32, result has 54.3 percent of original size [2019-11-15 21:52:06,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:06,499 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:38 [2019-11-15 21:52:06,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:06,583 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 38 treesize of output 25 [2019-11-15 21:52:06,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:06,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:06,635 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-15 21:52:06,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 54 [2019-11-15 21:52:06,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,673 INFO L567 ElimStorePlain]: treesize reduction 34, result has 56.4 percent of original size [2019-11-15 21:52:06,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:06,674 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:44 [2019-11-15 21:52:06,767 INFO L341 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2019-11-15 21:52:06,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 34 [2019-11-15 21:52:06,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:06,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:06,822 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 79 treesize of output 132 [2019-11-15 21:52:06,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:06,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:06,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:06,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:06,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:06,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:06,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:06,826 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 21:52:06,900 INFO L567 ElimStorePlain]: treesize reduction 393, result has 16.9 percent of original size [2019-11-15 21:52:06,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:06,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:06,901 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:67 [2019-11-15 21:52:06,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 21:52:06,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:06,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:06,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 21:52:06,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:07,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:07,000 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 21:52:07,000 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2019-11-15 21:52:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:07,087 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:07,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2019-11-15 21:52:07,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326602709] [2019-11-15 21:52:07,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 21:52:07,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:07,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 21:52:07,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2019-11-15 21:52:07,088 INFO L87 Difference]: Start difference. First operand 265 states and 317 transitions. Second operand 29 states. [2019-11-15 21:52:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:09,139 INFO L93 Difference]: Finished difference Result 346 states and 407 transitions. [2019-11-15 21:52:09,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 21:52:09,140 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2019-11-15 21:52:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:09,141 INFO L225 Difference]: With dead ends: 346 [2019-11-15 21:52:09,142 INFO L226 Difference]: Without dead ends: 346 [2019-11-15 21:52:09,142 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=270, Invalid=1710, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 21:52:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-15 21:52:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 267. [2019-11-15 21:52:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-15 21:52:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 318 transitions. [2019-11-15 21:52:09,148 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 318 transitions. Word has length 39 [2019-11-15 21:52:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:09,149 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 318 transitions. [2019-11-15 21:52:09,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 21:52:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 318 transitions. [2019-11-15 21:52:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 21:52:09,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:09,150 INFO L380 BasicCegarLoop]: trace histogram [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 21:52:09,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:09,354 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:52:09,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1210435084, now seen corresponding path program 2 times [2019-11-15 21:52:09,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:09,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902544753] [2019-11-15 21:52:09,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:09,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:09,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:09,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902544753] [2019-11-15 21:52:09,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638873060] [2019-11-15 21:52:09,647 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:52:09,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:52:09,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:52:09,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-15 21:52:09,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:09,940 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_65|], 1=[|v_#valid_87|]} [2019-11-15 21:52:09,942 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 21:52:09,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:09,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:09,961 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:09,961 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 21:52:09,962 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:09,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:09,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:09,973 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-11-15 21:52:10,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:10,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:10,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:10,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:10,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:10,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:10,041 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 21:52:10,041 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2019-11-15 21:52:10,147 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:10,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:52:10,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:10,183 INFO L567 ElimStorePlain]: treesize reduction 24, result has 68.0 percent of original size [2019-11-15 21:52:10,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:10,186 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:10,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:10,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:10,201 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2019-11-15 21:52:10,279 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 21:52:10,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 105 [2019-11-15 21:52:10,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:10,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:10,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:10,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:52:10,334 INFO L567 ElimStorePlain]: treesize reduction 166, result has 34.6 percent of original size [2019-11-15 21:52:10,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:10,339 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 78 treesize of output 53 [2019-11-15 21:52:10,339 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:10,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:10,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:10,354 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:56 [2019-11-15 21:52:10,446 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:10,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:10,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2019-11-15 21:52:10,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:10,491 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.2 percent of original size [2019-11-15 21:52:10,494 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:10,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:52:10,495 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:10,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:10,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:10,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:73, output treesize:9 [2019-11-15 21:52:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:10,583 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:10,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 25 [2019-11-15 21:52:10,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426240373] [2019-11-15 21:52:10,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 21:52:10,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:10,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 21:52:10,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2019-11-15 21:52:10,585 INFO L87 Difference]: Start difference. First operand 267 states and 318 transitions. Second operand 26 states. [2019-11-15 21:52:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:12,287 INFO L93 Difference]: Finished difference Result 342 states and 401 transitions. [2019-11-15 21:52:12,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 21:52:12,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 41 [2019-11-15 21:52:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:12,289 INFO L225 Difference]: With dead ends: 342 [2019-11-15 21:52:12,289 INFO L226 Difference]: Without dead ends: 342 [2019-11-15 21:52:12,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=247, Invalid=1393, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 21:52:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-11-15 21:52:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 281. [2019-11-15 21:52:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-15 21:52:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 337 transitions. [2019-11-15 21:52:12,296 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 337 transitions. Word has length 41 [2019-11-15 21:52:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:12,297 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 337 transitions. [2019-11-15 21:52:12,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 21:52:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 337 transitions. [2019-11-15 21:52:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 21:52:12,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:12,298 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:12,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:12,503 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:52:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:12,503 INFO L82 PathProgramCache]: Analyzing trace with hash 581934105, now seen corresponding path program 4 times [2019-11-15 21:52:12,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:12,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048168784] [2019-11-15 21:52:12,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:12,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:12,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:13,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048168784] [2019-11-15 21:52:13,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840821601] [2019-11-15 21:52:13,210 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:52:13,416 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:52:13,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:52:13,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-15 21:52:13,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:13,446 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:13,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:52:13,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,473 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 21:52:13,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 21:52:13,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:13,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:13,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:13,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:13,556 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 21:52:13,557 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-15 21:52:13,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 21:52:13,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:13,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2019-11-15 21:52:13,720 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:13,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2019-11-15 21:52:13,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,748 INFO L567 ElimStorePlain]: treesize reduction 16, result has 68.6 percent of original size [2019-11-15 21:52:13,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:35 [2019-11-15 21:52:13,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:13,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:13,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:13,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:35 [2019-11-15 21:52:13,840 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:13,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-15 21:52:13,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,894 INFO L567 ElimStorePlain]: treesize reduction 28, result has 64.6 percent of original size [2019-11-15 21:52:13,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:51 [2019-11-15 21:52:13,956 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_75|], 6=[|v_#memory_$Pointer$.base_105|]} [2019-11-15 21:52:13,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:13,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:13,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:13,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:13,988 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,024 INFO L567 ElimStorePlain]: treesize reduction 4, result has 92.7 percent of original size [2019-11-15 21:52:14,025 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 21:52:14,025 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:56 [2019-11-15 21:52:14,089 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 7 [2019-11-15 21:52:14,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:73 [2019-11-15 21:52:14,242 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 86 [2019-11-15 21:52:14,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,246 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 21:52:14,291 INFO L567 ElimStorePlain]: treesize reduction 40, result has 56.0 percent of original size [2019-11-15 21:52:14,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:84, output treesize:56 [2019-11-15 21:52:14,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:14,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 56 [2019-11-15 21:52:14,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,403 INFO L567 ElimStorePlain]: treesize reduction 48, result has 53.8 percent of original size [2019-11-15 21:52:14,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 21:52:14,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:14,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 case distinctions, treesize of input 31 treesize of output 119 [2019-11-15 21:52:14,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,526 INFO L567 ElimStorePlain]: treesize reduction 54, result has 58.8 percent of original size [2019-11-15 21:52:14,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:77 [2019-11-15 21:52:14,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 76 [2019-11-15 21:52:14,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:14,668 INFO L567 ElimStorePlain]: treesize reduction 68, result has 48.9 percent of original size [2019-11-15 21:52:14,668 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 21:52:14,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:74 [2019-11-15 21:52:14,923 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:14,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 161 [2019-11-15 21:52:14,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:14,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:14,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:14,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:14,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:14,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:14,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:14,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:14,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:14,970 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 21:52:15,036 INFO L567 ElimStorePlain]: treesize reduction 96, result has 40.0 percent of original size [2019-11-15 21:52:15,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:15,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:134, output treesize:82 [2019-11-15 21:52:15,251 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-11-15 21:52:15,251 INFO L341 Elim1Store]: treesize reduction 62, result has 71.4 percent of original size [2019-11-15 21:52:15,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 174 treesize of output 209 [2019-11-15 21:52:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:15,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 21:52:15,343 INFO L567 ElimStorePlain]: treesize reduction 1303, result has 9.0 percent of original size [2019-11-15 21:52:15,343 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 21:52:15,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:182, output treesize:127 [2019-11-15 21:52:15,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:15,562 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 126 treesize of output 103 [2019-11-15 21:52:15,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:15,584 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 21:52:15,663 INFO L567 ElimStorePlain]: treesize reduction 48, result has 48.4 percent of original size [2019-11-15 21:52:15,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:15,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:131, output treesize:45 [2019-11-15 21:52:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:15,890 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:15,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 44 [2019-11-15 21:52:15,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48616911] [2019-11-15 21:52:15,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-15 21:52:15,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-15 21:52:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1717, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 21:52:15,893 INFO L87 Difference]: Start difference. First operand 281 states and 337 transitions. Second operand 45 states. [2019-11-15 21:52:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:22,209 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2019-11-15 21:52:22,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-15 21:52:22,210 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 42 [2019-11-15 21:52:22,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:22,211 INFO L225 Difference]: With dead ends: 483 [2019-11-15 21:52:22,211 INFO L226 Difference]: Without dead ends: 483 [2019-11-15 21:52:22,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3109 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1587, Invalid=8513, Unknown=0, NotChecked=0, Total=10100 [2019-11-15 21:52:22,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-15 21:52:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 286. [2019-11-15 21:52:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-15 21:52:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 343 transitions. [2019-11-15 21:52:22,220 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 343 transitions. Word has length 42 [2019-11-15 21:52:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:22,220 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 343 transitions. [2019-11-15 21:52:22,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-15 21:52:22,221 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 343 transitions. [2019-11-15 21:52:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 21:52:22,221 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:22,221 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:22,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:22,430 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:52:22,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:22,430 INFO L82 PathProgramCache]: Analyzing trace with hash 581934106, now seen corresponding path program 3 times [2019-11-15 21:52:22,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:22,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302735779] [2019-11-15 21:52:22,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:22,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:22,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:23,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302735779] [2019-11-15 21:52:23,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673926619] [2019-11-15 21:52:23,162 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:52:23,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 21:52:23,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:52:23,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 75 conjunts are in the unsatisfiable core [2019-11-15 21:52:23,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:23,522 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 21:52:23,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 21:52:23,527 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_66|], 3=[|v_#valid_92|]} [2019-11-15 21:52:23,530 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 21:52:23,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,567 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:52:23,567 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,593 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-15 21:52:23,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,593 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-11-15 21:52:23,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:23,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,660 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.4 percent of original size [2019-11-15 21:52:23,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:23,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,678 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 21:52:23,678 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:48 [2019-11-15 21:52:23,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 56 [2019-11-15 21:52:23,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,834 INFO L567 ElimStorePlain]: treesize reduction 24, result has 69.6 percent of original size [2019-11-15 21:52:23,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:23,837 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,852 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:51 [2019-11-15 21:52:23,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:23,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:23,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:23,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:23,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,948 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:51 [2019-11-15 21:52:23,950 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_67|], 3=[|v_#valid_93|]} [2019-11-15 21:52:23,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:23,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-15 21:52:23,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,000 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 21:52:24,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,040 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2019-11-15 21:52:24,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:24,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:24,117 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,134 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 21:52:24,134 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-11-15 21:52:24,272 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_80|], 6=[|v_#memory_$Pointer$.base_115|]} [2019-11-15 21:52:24,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:24,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 21:52:24,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,341 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 110 [2019-11-15 21:52:24,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:24,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:24,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:24,344 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:24,398 INFO L567 ElimStorePlain]: treesize reduction 60, result has 50.4 percent of original size [2019-11-15 21:52:24,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:24,398 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:70 [2019-11-15 21:52:24,462 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_81|], 12=[|v_#memory_$Pointer$.base_116|]} [2019-11-15 21:52:24,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:24,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:24,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:24,539 INFO L341 Elim1Store]: treesize reduction 24, result has 63.6 percent of original size [2019-11-15 21:52:24,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 78 [2019-11-15 21:52:24,540 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,584 INFO L567 ElimStorePlain]: treesize reduction 50, result has 58.3 percent of original size [2019-11-15 21:52:24,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:24,585 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:70 [2019-11-15 21:52:24,609 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 66 [2019-11-15 21:52:24,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,670 INFO L567 ElimStorePlain]: treesize reduction 40, result has 66.1 percent of original size [2019-11-15 21:52:24,670 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 21:52:24,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:79, output treesize:78 [2019-11-15 21:52:24,739 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_82|], 12=[|v_#memory_$Pointer$.base_117|]} [2019-11-15 21:52:24,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:24,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,795 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:24,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 92 [2019-11-15 21:52:24,795 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:24,844 INFO L567 ElimStorePlain]: treesize reduction 72, result has 51.0 percent of original size [2019-11-15 21:52:24,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:24,844 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:72 [2019-11-15 21:52:25,036 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_83|], 12=[|v_#memory_$Pointer$.base_118|]} [2019-11-15 21:52:25,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:25,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 111 [2019-11-15 21:52:25,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:25,153 INFO L567 ElimStorePlain]: treesize reduction 75, result has 61.9 percent of original size [2019-11-15 21:52:25,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:25,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 169 [2019-11-15 21:52:25,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:25,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,463 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:25,613 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-11-15 21:52:25,614 INFO L567 ElimStorePlain]: treesize reduction 80, result has 56.3 percent of original size [2019-11-15 21:52:25,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:25,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:141, output treesize:103 [2019-11-15 21:52:25,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:25,763 INFO L392 ElimStorePlain]: Different costs {82=[|v_#memory_$Pointer$.offset_84|], 132=[|v_#memory_$Pointer$.base_119|]} [2019-11-15 21:52:25,976 INFO L235 Elim1Store]: Index analysis took 175 ms [2019-11-15 21:52:26,085 INFO L341 Elim1Store]: treesize reduction 36, result has 62.5 percent of original size [2019-11-15 21:52:26,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 183 [2019-11-15 21:52:26,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:26,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 149 [2019-11-15 21:52:26,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:26,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:26,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 97 [2019-11-15 21:52:26,186 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:26,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 119 [2019-11-15 21:52:26,214 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:26,910 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 120 [2019-11-15 21:52:26,910 INFO L567 ElimStorePlain]: treesize reduction 12, result has 97.6 percent of original size [2019-11-15 21:52:27,017 INFO L341 Elim1Store]: treesize reduction 20, result has 66.7 percent of original size [2019-11-15 21:52:27,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 104 [2019-11-15 21:52:27,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,021 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:27,082 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:27,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 143 treesize of output 146 [2019-11-15 21:52:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,086 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:27,236 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-11-15 21:52:27,237 INFO L341 Elim1Store]: treesize reduction 40, result has 71.2 percent of original size [2019-11-15 21:52:27,237 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 6 new quantified variables, introduced 8 case distinctions, treesize of input 146 treesize of output 181 [2019-11-15 21:52:27,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,276 INFO L496 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:27,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:27,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 138 [2019-11-15 21:52:27,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,352 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:27,752 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 121 [2019-11-15 21:52:27,752 INFO L567 ElimStorePlain]: treesize reduction 612, result has 38.8 percent of original size [2019-11-15 21:52:27,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-11-15 21:52:27,756 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:578, output treesize:381 [2019-11-15 21:52:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:27,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:28,023 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 86 [2019-11-15 21:52:28,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:28,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:28,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:28,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:28,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:29,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:29,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:29,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:29,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:29,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:30,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:30,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:30,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:30,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:30,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:30,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:30,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:30,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:30,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:30,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:30,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:30,466 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2019-11-15 21:52:30,693 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-11-15 21:52:30,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 21:52:31,452 WARN L191 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 120 [2019-11-15 21:52:31,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:31,647 INFO L392 ElimStorePlain]: Different costs {36=[|#memory_$Pointer$.offset|], 66=[|#memory_$Pointer$.base|]} [2019-11-15 21:52:31,653 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:31,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:31,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2019-11-15 21:52:31,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,662 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:31,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:31,666 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:31,676 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,677 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 136 [2019-11-15 21:52:31,677 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:31,683 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:31,684 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 80 [2019-11-15 21:52:31,684 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:31,853 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-11-15 21:52:31,853 INFO L567 ElimStorePlain]: treesize reduction 12, result has 95.7 percent of original size [2019-11-15 21:52:31,859 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:31,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:31,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 76 [2019-11-15 21:52:31,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,880 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:31,894 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:31,899 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:31,918 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 66 [2019-11-15 21:52:31,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,920 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:31,927 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:31,971 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:31,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 107 treesize of output 121 [2019-11-15 21:52:31,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:31,984 INFO L496 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:32,157 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 64 [2019-11-15 21:52:32,158 INFO L567 ElimStorePlain]: treesize reduction 84, result has 63.6 percent of original size [2019-11-15 21:52:32,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-11-15 21:52:32,161 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:365, output treesize:101 [2019-11-15 21:52:32,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:32,340 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:32,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2019-11-15 21:52:32,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473996434] [2019-11-15 21:52:32,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-11-15 21:52:32,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:32,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-11-15 21:52:32,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1993, Unknown=9, NotChecked=0, Total=2256 [2019-11-15 21:52:32,342 INFO L87 Difference]: Start difference. First operand 286 states and 343 transitions. Second operand 48 states. [2019-11-15 21:52:33,906 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-11-15 21:52:34,183 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-11-15 21:52:35,400 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 95 [2019-11-15 21:52:36,274 WARN L191 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 129 [2019-11-15 21:52:38,075 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 190 DAG size of output: 135 [2019-11-15 21:52:38,745 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 88 [2019-11-15 21:52:39,071 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 106 [2019-11-15 21:52:39,788 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 78 [2019-11-15 21:52:40,137 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 100 [2019-11-15 21:52:40,885 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 94 [2019-11-15 21:52:41,283 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 102 [2019-11-15 21:52:41,613 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 107 [2019-11-15 21:52:41,949 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 111 [2019-11-15 21:52:42,375 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-11-15 21:52:43,112 WARN L191 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 106 [2019-11-15 21:52:44,062 WARN L191 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 135 [2019-11-15 21:52:45,220 WARN L191 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 88 [2019-11-15 21:52:45,985 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 78 [2019-11-15 21:52:46,581 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 95 [2019-11-15 21:52:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:48,719 INFO L93 Difference]: Finished difference Result 439 states and 505 transitions. [2019-11-15 21:52:48,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-11-15 21:52:48,719 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 42 [2019-11-15 21:52:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:48,721 INFO L225 Difference]: With dead ends: 439 [2019-11-15 21:52:48,721 INFO L226 Difference]: Without dead ends: 439 [2019-11-15 21:52:48,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3849 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=1500, Invalid=10234, Unknown=38, NotChecked=0, Total=11772 [2019-11-15 21:52:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-11-15 21:52:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 281. [2019-11-15 21:52:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-15 21:52:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 337 transitions. [2019-11-15 21:52:48,731 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 337 transitions. Word has length 42 [2019-11-15 21:52:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:48,731 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 337 transitions. [2019-11-15 21:52:48,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-11-15 21:52:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 337 transitions. [2019-11-15 21:52:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:52:48,733 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:48,733 INFO L380 BasicCegarLoop]: trace histogram [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 21:52:48,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:48,938 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:52:48,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:48,938 INFO L82 PathProgramCache]: Analyzing trace with hash -708026045, now seen corresponding path program 1 times [2019-11-15 21:52:48,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:48,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434144539] [2019-11-15 21:52:48,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:48,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:48,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:52:49,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434144539] [2019-11-15 21:52:49,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:49,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:52:49,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64783233] [2019-11-15 21:52:49,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:52:49,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:49,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:52:49,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:52:49,023 INFO L87 Difference]: Start difference. First operand 281 states and 337 transitions. Second operand 5 states. [2019-11-15 21:52:49,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:49,317 INFO L93 Difference]: Finished difference Result 285 states and 337 transitions. [2019-11-15 21:52:49,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:49,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-15 21:52:49,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:49,319 INFO L225 Difference]: With dead ends: 285 [2019-11-15 21:52:49,319 INFO L226 Difference]: Without dead ends: 285 [2019-11-15 21:52:49,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-15 21:52:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-11-15 21:52:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-15 21:52:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 334 transitions. [2019-11-15 21:52:49,325 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 334 transitions. Word has length 43 [2019-11-15 21:52:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:49,325 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 334 transitions. [2019-11-15 21:52:49,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:52:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 334 transitions. [2019-11-15 21:52:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:52:49,325 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:49,326 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-11-15 21:52:49,326 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:52:49,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:49,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1564086200, now seen corresponding path program 5 times [2019-11-15 21:52:49,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:49,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185505387] [2019-11-15 21:52:49,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:49,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:49,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:49,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185505387] [2019-11-15 21:52:49,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149205879] [2019-11-15 21:52:49,697 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:52:49,897 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-15 21:52:49,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:52:49,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-15 21:52:49,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:49,938 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:49,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:52:49,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:49,981 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-15 21:52:49,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:49,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-15 21:52:50,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:50,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,104 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.6 percent of original size [2019-11-15 21:52:50,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:50,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:50,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,126 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:36 [2019-11-15 21:52:50,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:50,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-11-15 21:52:50,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,384 INFO L567 ElimStorePlain]: treesize reduction 24, result has 69.2 percent of original size [2019-11-15 21:52:50,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:50,387 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:50,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,402 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:50 [2019-11-15 21:52:50,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:50,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:50,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:50,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:50,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2019-11-15 21:52:50,505 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:50,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,533 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:50 [2019-11-15 21:52:50,580 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:50,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-15 21:52:50,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,632 INFO L567 ElimStorePlain]: treesize reduction 28, result has 69.2 percent of original size [2019-11-15 21:52:50,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:63 [2019-11-15 21:52:50,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:50,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:50,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-11-15 21:52:50,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:50,737 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 21:52:50,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:61 [2019-11-15 21:52:50,866 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_89|], 6=[|v_#memory_$Pointer$.base_124|]} [2019-11-15 21:52:50,882 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:50,883 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 87 treesize of output 94 [2019-11-15 21:52:50,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:50,925 INFO L567 ElimStorePlain]: treesize reduction 24, result has 80.6 percent of original size [2019-11-15 21:52:50,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:50,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 110 [2019-11-15 21:52:50,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:50,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:50,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:50,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:50,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:50,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:50,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:50,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:50,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:50,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:50,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:50,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:50,964 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:51,011 INFO L567 ElimStorePlain]: treesize reduction 60, result has 51.2 percent of original size [2019-11-15 21:52:51,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:51,012 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:72 [2019-11-15 21:52:51,069 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_90|], 12=[|v_#memory_$Pointer$.base_125|]} [2019-11-15 21:52:51,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:51,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 29 [2019-11-15 21:52:51,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:51,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:51,197 INFO L341 Elim1Store]: treesize reduction 50, result has 67.1 percent of original size [2019-11-15 21:52:51,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 155 [2019-11-15 21:52:51,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:51,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:51,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:51,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,205 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 21:52:51,346 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-11-15 21:52:51,347 INFO L567 ElimStorePlain]: treesize reduction 985, result has 9.4 percent of original size [2019-11-15 21:52:51,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:51,348 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:187, output treesize:101 [2019-11-15 21:52:51,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2019-11-15 21:52:51,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:51,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:51,548 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 21:52:51,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:115, output treesize:89 [2019-11-15 21:52:51,715 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:52:51,750 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:51,750 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 85 treesize of output 98 [2019-11-15 21:52:51,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:51,755 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 21:52:51,791 INFO L567 ElimStorePlain]: treesize reduction 60, result has 36.2 percent of original size [2019-11-15 21:52:51,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:51,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:96, output treesize:28 [2019-11-15 21:52:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:51,905 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:51,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2019-11-15 21:52:51,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532434930] [2019-11-15 21:52:51,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-15 21:52:51,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:51,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-15 21:52:51,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 21:52:51,909 INFO L87 Difference]: Start difference. First operand 281 states and 334 transitions. Second operand 38 states. [2019-11-15 21:52:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:54,370 INFO L93 Difference]: Finished difference Result 382 states and 442 transitions. [2019-11-15 21:52:54,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 21:52:54,371 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 43 [2019-11-15 21:52:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:54,373 INFO L225 Difference]: With dead ends: 382 [2019-11-15 21:52:54,373 INFO L226 Difference]: Without dead ends: 382 [2019-11-15 21:52:54,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=393, Invalid=2577, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 21:52:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-15 21:52:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 294. [2019-11-15 21:52:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-15 21:52:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 350 transitions. [2019-11-15 21:52:54,379 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 350 transitions. Word has length 43 [2019-11-15 21:52:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:54,379 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 350 transitions. [2019-11-15 21:52:54,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-15 21:52:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 350 transitions. [2019-11-15 21:52:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:52:54,380 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:54,380 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-11-15 21:52:54,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:52:54,581 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:52:54,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:54,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1564086201, now seen corresponding path program 4 times [2019-11-15 21:52:54,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:52:54,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130292989] [2019-11-15 21:52:54,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:54,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:52:54,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:52:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:55,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130292989] [2019-11-15 21:52:55,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458517698] [2019-11-15 21:52:55,022 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:52:55,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:52:55,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:52:55,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-15 21:52:55,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:55,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:55,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 21:52:55,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,327 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 21:52:55,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 21:52:55,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:55,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,406 INFO L567 ElimStorePlain]: treesize reduction 5, result has 89.4 percent of original size [2019-11-15 21:52:55,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:52:55,408 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:55,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,421 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-11-15 21:52:55,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:55,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:55,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:55,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:55,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2019-11-15 21:52:55,577 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,611 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.4 percent of original size [2019-11-15 21:52:55,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,611 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:49 [2019-11-15 21:52:55,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:55,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:55,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:55,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:55,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 21:52:55,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:55,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-15 21:52:55,716 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_69|], 3=[|v_#valid_97|]} [2019-11-15 21:52:55,719 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 21:52:55,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:55,755 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:55,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 21:52:55,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:55,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,775 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:55 [2019-11-15 21:52:55,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:55,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,873 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.7 percent of original size [2019-11-15 21:52:55,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:55,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:52:55,879 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:55,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:55,895 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 21:52:55,895 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:53 [2019-11-15 21:52:56,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:56,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:56,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:56,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-15 21:52:56,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:56,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:56,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:56,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 104 [2019-11-15 21:52:56,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:56,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:56,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,118 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:56,185 INFO L567 ElimStorePlain]: treesize reduction 56, result has 51.3 percent of original size [2019-11-15 21:52:56,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:56,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:64 [2019-11-15 21:52:56,316 INFO L341 Elim1Store]: treesize reduction 50, result has 66.2 percent of original size [2019-11-15 21:52:56,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 168 [2019-11-15 21:52:56,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:56,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:56,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:56,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:52:56,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-11-15 21:52:56,462 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-11-15 21:52:56,462 INFO L567 ElimStorePlain]: treesize reduction 1389, result has 9.0 percent of original size [2019-11-15 21:52:56,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:56,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:56,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 99 [2019-11-15 21:52:56,469 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:56,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:56,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:52:56,485 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:93 [2019-11-15 21:52:56,767 INFO L341 Elim1Store]: treesize reduction 8, result has 86.7 percent of original size [2019-11-15 21:52:56,767 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 113 treesize of output 102 [2019-11-15 21:52:56,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:52:56,771 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 21:52:56,803 INFO L567 ElimStorePlain]: treesize reduction 44, result has 53.2 percent of original size [2019-11-15 21:52:56,808 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:56,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2019-11-15 21:52:56,808 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:56,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:56,815 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 21:52:56,816 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:120, output treesize:9 [2019-11-15 21:52:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:52:56,845 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:52:56,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2019-11-15 21:52:56,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030689924] [2019-11-15 21:52:56,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 21:52:56,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:52:56,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 21:52:56,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 21:52:56,846 INFO L87 Difference]: Start difference. First operand 294 states and 350 transitions. Second operand 37 states. [2019-11-15 21:52:59,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:59,965 INFO L93 Difference]: Finished difference Result 383 states and 444 transitions. [2019-11-15 21:52:59,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 21:52:59,965 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 43 [2019-11-15 21:52:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:59,967 INFO L225 Difference]: With dead ends: 383 [2019-11-15 21:52:59,967 INFO L226 Difference]: Without dead ends: 383 [2019-11-15 21:52:59,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=333, Invalid=2529, Unknown=0, NotChecked=0, Total=2862 [2019-11-15 21:52:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-15 21:52:59,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 289. [2019-11-15 21:52:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-15 21:52:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 344 transitions. [2019-11-15 21:52:59,971 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 344 transitions. Word has length 43 [2019-11-15 21:52:59,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:59,972 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 344 transitions. [2019-11-15 21:52:59,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 21:52:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 344 transitions. [2019-11-15 21:52:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:52:59,973 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:59,973 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:00,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:53:00,173 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:53:00,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:00,173 INFO L82 PathProgramCache]: Analyzing trace with hash 358536653, now seen corresponding path program 2 times [2019-11-15 21:53:00,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:00,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170971320] [2019-11-15 21:53:00,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:00,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:00,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:00,775 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 21:53:00,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170971320] [2019-11-15 21:53:00,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015311198] [2019-11-15 21:53:00,776 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:53:00,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:53:00,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:53:00,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-15 21:53:00,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:01,066 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_70|], 1=[|v_#valid_98|]} [2019-11-15 21:53:01,069 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 21:53:01,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,088 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 21:53:01,088 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,099 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-15 21:53:01,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:53:01,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:53:01,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,171 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 21:53:01,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2019-11-15 21:53:01,301 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:53:01,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2019-11-15 21:53:01,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,347 INFO L567 ElimStorePlain]: treesize reduction 19, result has 73.2 percent of original size [2019-11-15 21:53:01,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 21:53:01,350 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,364 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:48 [2019-11-15 21:53:01,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:01,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 103 [2019-11-15 21:53:01,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,457 INFO L567 ElimStorePlain]: treesize reduction 16, result has 85.8 percent of original size [2019-11-15 21:53:01,470 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 95 [2019-11-15 21:53:01,471 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,497 INFO L567 ElimStorePlain]: treesize reduction 58, result has 50.0 percent of original size [2019-11-15 21:53:01,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:58 [2019-11-15 21:53:01,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:01,661 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 57 treesize of output 39 [2019-11-15 21:53:01,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:01,692 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 53 [2019-11-15 21:53:01,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,730 INFO L567 ElimStorePlain]: treesize reduction 28, result has 70.5 percent of original size [2019-11-15 21:53:01,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:67 [2019-11-15 21:53:01,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:53:01,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 21:53:01,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,858 INFO L567 ElimStorePlain]: treesize reduction 7, result has 95.0 percent of original size [2019-11-15 21:53:01,861 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:53:01,862 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:53:01,874 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 126 [2019-11-15 21:53:01,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,916 INFO L567 ElimStorePlain]: treesize reduction 58, result has 61.8 percent of original size [2019-11-15 21:53:01,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:53:01,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:01,924 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 74 [2019-11-15 21:53:01,925 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,953 INFO L567 ElimStorePlain]: treesize reduction 16, result has 77.5 percent of original size [2019-11-15 21:53:01,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,954 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:157, output treesize:52 [2019-11-15 21:53:02,185 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:53:02,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2019-11-15 21:53:02,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:02,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:02,209 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:53:02,223 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:02,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 59 [2019-11-15 21:53:02,224 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:02,258 INFO L567 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2019-11-15 21:53:02,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:02,258 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:88, output treesize:18 [2019-11-15 21:53:02,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 21:53:02,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:02,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:02,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 21:53:02,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:02,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:02,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:02,359 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-15 21:53:02,369 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 21:53:02,369 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:53:02,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 40 [2019-11-15 21:53:02,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772270818] [2019-11-15 21:53:02,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 21:53:02,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:53:02,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 21:53:02,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1407, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 21:53:02,370 INFO L87 Difference]: Start difference. First operand 289 states and 344 transitions. Second operand 40 states. [2019-11-15 21:53:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:05,360 INFO L93 Difference]: Finished difference Result 423 states and 491 transitions. [2019-11-15 21:53:05,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 21:53:05,360 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 44 [2019-11-15 21:53:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:05,362 INFO L225 Difference]: With dead ends: 423 [2019-11-15 21:53:05,362 INFO L226 Difference]: Without dead ends: 423 [2019-11-15 21:53:05,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=447, Invalid=3843, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 21:53:05,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-11-15 21:53:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 291. [2019-11-15 21:53:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-15 21:53:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 346 transitions. [2019-11-15 21:53:05,368 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 346 transitions. Word has length 44 [2019-11-15 21:53:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:05,369 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 346 transitions. [2019-11-15 21:53:05,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 21:53:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 346 transitions. [2019-11-15 21:53:05,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:53:05,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:05,370 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:05,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:53:05,574 INFO L410 AbstractCegarLoop]: === Iteration 36 === [mainErr36REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION]=== [2019-11-15 21:53:05,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash 403407594, now seen corresponding path program 3 times [2019-11-15 21:53:05,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:53:05,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359641448] [2019-11-15 21:53:05,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:05,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:53:05,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:53:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:53:06,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359641448] [2019-11-15 21:53:06,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238097171] [2019-11-15 21:53:06,235 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:53:06,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 21:53:06,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:53:06,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-15 21:53:06,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:06,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:53:06,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:06,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:06,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:53:06,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:06,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:06,706 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 21:53:06,706 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-11-15 21:53:06,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 21:53:06,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:06,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:06,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:06,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:14 [2019-11-15 21:53:06,802 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:06,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 42 [2019-11-15 21:53:06,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:06,824 INFO L567 ElimStorePlain]: treesize reduction 16, result has 64.4 percent of original size [2019-11-15 21:53:06,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:06,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:29 [2019-11-15 21:53:06,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:06,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:06,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:06,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:06,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2019-11-15 21:53:06,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:06,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:06,882 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 39 treesize of output 23 [2019-11-15 21:53:06,882 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:06,919 INFO L567 ElimStorePlain]: treesize reduction 19, result has 67.2 percent of original size [2019-11-15 21:53:06,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 21:53:06,919 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:80, output treesize:39 [2019-11-15 21:53:07,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,043 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_104|], 6=[|v_#memory_$Pointer$.base_141|]} [2019-11-15 21:53:07,051 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 47 treesize of output 43 [2019-11-15 21:53:07,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,059 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 48 treesize of output 44 [2019-11-15 21:53:07,059 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,130 INFO L567 ElimStorePlain]: treesize reduction 3, result has 96.6 percent of original size [2019-11-15 21:53:07,158 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 75 [2019-11-15 21:53:07,159 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2019-11-15 21:53:07,164 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,230 INFO L567 ElimStorePlain]: treesize reduction 36, result has 63.6 percent of original size [2019-11-15 21:53:07,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 21:53:07,230 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:49 [2019-11-15 21:53:07,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,299 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 30 treesize of output 22 [2019-11-15 21:53:07,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,322 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 46 treesize of output 30 [2019-11-15 21:53:07,322 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 21:53:07,340 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-11-15 21:53:07,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,461 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 30 treesize of output 45 [2019-11-15 21:53:07,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,496 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 91 [2019-11-15 21:53:07,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,500 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:07,573 INFO L567 ElimStorePlain]: treesize reduction 52, result has 59.4 percent of original size [2019-11-15 21:53:07,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 21:53:07,574 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:76 [2019-11-15 21:53:07,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:07,695 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 40 [2019-11-15 21:53:07,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:07,713 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2019-11-15 21:53:07,714 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:07,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:07,735 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2019-11-15 21:53:07,735 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:07,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:07,772 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:07,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 74 [2019-11-15 21:53:07,774 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:07,781 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 44 treesize of output 28 [2019-11-15 21:53:07,781 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:07,889 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-11-15 21:53:07,890 INFO L567 ElimStorePlain]: treesize reduction 98, result has 58.5 percent of original size [2019-11-15 21:53:07,890 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 5 xjuncts. [2019-11-15 21:53:07,890 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:239, output treesize:138 [2019-11-15 21:53:07,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:07,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:08,019 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 35 treesize of output 51 [2019-11-15 21:53:08,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:08,035 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 34 treesize of output 50 [2019-11-15 21:53:08,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:08,087 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 39 treesize of output 67 [2019-11-15 21:53:08,087 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:08,113 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 43 treesize of output 71 [2019-11-15 21:53:08,113 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,131 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:08,131 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 41 treesize of output 57 [2019-11-15 21:53:08,132 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,306 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-11-15 21:53:08,306 INFO L567 ElimStorePlain]: treesize reduction 100, result has 64.5 percent of original size [2019-11-15 21:53:08,306 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 5 xjuncts. [2019-11-15 21:53:08,306 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:193, output treesize:182 [2019-11-15 21:53:08,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 21:53:08,429 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_105|], 19=[|v_#memory_$Pointer$.base_144|]} [2019-11-15 21:53:08,436 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 62 treesize of output 58 [2019-11-15 21:53:08,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,442 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 61 treesize of output 57 [2019-11-15 21:53:08,442 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,449 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 49 treesize of output 45 [2019-11-15 21:53:08,449 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:08,457 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 58 treesize of output 1 [2019-11-15 21:53:08,458 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,463 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 66 treesize of output 62 [2019-11-15 21:53:08,464 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,591 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-11-15 21:53:08,591 INFO L567 ElimStorePlain]: treesize reduction 62, result has 72.2 percent of original size [2019-11-15 21:53:08,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:08,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 80 [2019-11-15 21:53:08,617 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,667 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:08,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 131 [2019-11-15 21:53:08,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:08,673 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:08,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2019-11-15 21:53:08,678 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,784 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2019-11-15 21:53:08,785 INFO L567 ElimStorePlain]: treesize reduction 108, result has 53.2 percent of original size [2019-11-15 21:53:08,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-15 21:53:08,785 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:297, output treesize:115 [2019-11-15 21:53:08,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,137 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:09,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 182 [2019-11-15 21:53:09,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,296 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:09,388 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:09,388 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 70 treesize of output 123 [2019-11-15 21:53:09,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:53:09,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,399 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 21:53:09,407 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 21:53:09,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:09,419 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 54 treesize of output 69 [2019-11-15 21:53:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:09,420 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:09,689 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 99 [2019-11-15 21:53:09,690 INFO L567 ElimStorePlain]: treesize reduction 104, result has 71.6 percent of original size [2019-11-15 21:53:09,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:53:09,891 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-15 21:53:09,896 INFO L168 Benchmark]: Toolchain (without parser) took 122726.92 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 649.1 MB). Free memory was 940.7 MB in the beginning and 1.6 GB in the end (delta: -619.2 MB). Peak memory consumption was 782.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:09,896 INFO L168 Benchmark]: CDTParser took 0.30 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 21:53:09,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -204.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:09,897 INFO L168 Benchmark]: Boogie Preprocessor took 60.29 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 21:53:09,897 INFO L168 Benchmark]: RCFGBuilder took 852.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:09,897 INFO L168 Benchmark]: TraceAbstraction took 121177.09 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 480.2 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -481.9 MB). Peak memory consumption was 750.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:09,898 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.30 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 632.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -204.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.29 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 852.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 121177.09 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 480.2 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -481.9 MB). Peak memory consumption was 750.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 21:53:12,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:53:12,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:53:12,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:53:12,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:53:12,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:53:12,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:53:12,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:53:12,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:53:12,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:53:12,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:53:12,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:53:12,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:53:12,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:53:12,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:53:12,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:53:12,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:53:12,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:53:12,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:53:12,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:53:12,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:53:12,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:53:12,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:53:12,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:53:12,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:53:12,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:53:12,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:53:12,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:53:12,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:53:12,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:53:12,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:53:12,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:53:12,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:53:12,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:53:12,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:53:12,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:53:12,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:53:12,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:53:12,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:53:12,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:53:12,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:53:12,405 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 21:53:12,437 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:53:12,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:53:12,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:53:12,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:53:12,451 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:53:12,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:53:12,452 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:53:12,452 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:53:12,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:53:12,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:53:12,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:53:12,453 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:53:12,454 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:53:12,454 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:53:12,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:53:12,454 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:53:12,455 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:53:12,455 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:53:12,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:53:12,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:53:12,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:53:12,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:53:12,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:53:12,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:53:12,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:53:12,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:53:12,457 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:53:12,458 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:53:12,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:53:12,458 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 -> acdd122f5068e78adf2c5d9843dc58624176c7bc [2019-11-15 21:53:12,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:53:12,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:53:12,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:53:12,538 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:53:12,539 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:53:12,540 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2019-11-15 21:53:12,603 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/data/64e2d29d9/d9b3d76e98db439ea9213e63e63d1fa0/FLAG921e23bfc [2019-11-15 21:53:13,092 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:53:13,093 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2019-11-15 21:53:13,112 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/data/64e2d29d9/d9b3d76e98db439ea9213e63e63d1fa0/FLAG921e23bfc [2019-11-15 21:53:13,468 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/data/64e2d29d9/d9b3d76e98db439ea9213e63e63d1fa0 [2019-11-15 21:53:13,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:53:13,473 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:53:13,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:53:13,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:53:13,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:53:13,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:53:13" (1/1) ... [2019-11-15 21:53:13,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d78d08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:13, skipping insertion in model container [2019-11-15 21:53:13,489 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:53:13" (1/1) ... [2019-11-15 21:53:13,497 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:53:13,559 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:53:14,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:53:14,113 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:53:14,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:53:14,266 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:53:14,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:14 WrapperNode [2019-11-15 21:53:14,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:53:14,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:53:14,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:53:14,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:53:14,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:14" (1/1) ... [2019-11-15 21:53:14,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:14" (1/1) ... [2019-11-15 21:53:14,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:14" (1/1) ... [2019-11-15 21:53:14,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:14" (1/1) ... [2019-11-15 21:53:14,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:14" (1/1) ... [2019-11-15 21:53:14,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:14" (1/1) ... [2019-11-15 21:53:14,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:14" (1/1) ... [2019-11-15 21:53:14,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:53:14,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:53:14,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:53:14,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:53:14,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/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 21:53:14,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:53:14,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:53:14,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:53:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:53:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:53:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:53:14,518 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:53:14,518 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:53:14,519 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:53:14,519 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:53:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:53:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:53:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:53:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:53:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:53:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:53:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:53:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:53:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:53:14,522 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:53:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:53:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:53:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:53:14,523 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:53:14,524 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:53:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:53:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:53:14,525 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:53:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:53:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:53:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:53:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:53:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:53:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:53:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:53:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:53:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:53:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:53:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:53:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:53:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:53:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:53:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:53:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:53:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:53:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:53:14,529 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:53:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:53:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:53:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:53:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:53:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:53:14,531 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:53:14,531 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:53:14,531 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:53:14,531 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:53:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:53:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 21:53:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:53:14,532 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:53:14,533 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:53:14,533 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:53:14,533 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:53:14,533 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:53:14,534 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:53:14,534 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:53:14,534 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:53:14,535 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:53:14,535 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:53:14,535 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:53:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:53:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:53:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:53:14,537 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:53:14,538 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:53:14,538 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:53:14,538 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:53:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:53:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:53:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:53:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:53:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:53:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:53:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:53:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:53:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:53:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:53:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:53:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:53:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:53:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:53:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:53:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:53:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:53:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:53:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:53:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:53:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:53:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:53:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:53:14,544 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:53:14,544 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:53:14,544 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:53:14,544 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:53:14,544 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:53:14,545 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:53:14,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 21:53:14,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 21:53:14,545 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:53:14,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:53:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:53:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:53:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:53:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:53:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:53:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:53:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:53:15,815 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:53:15,815 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 21:53:15,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:53:15 BoogieIcfgContainer [2019-11-15 21:53:15,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:53:15,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:53:15,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:53:15,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:53:15,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:53:13" (1/3) ... [2019-11-15 21:53:15,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6191acd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:53:15, skipping insertion in model container [2019-11-15 21:53:15,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:53:14" (2/3) ... [2019-11-15 21:53:15,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6191acd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:53:15, skipping insertion in model container [2019-11-15 21:53:15,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:53:15" (3/3) ... [2019-11-15 21:53:15,829 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2019-11-15 21:53:15,840 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:53:15,857 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 54 error locations. [2019-11-15 21:53:15,869 INFO L249 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2019-11-15 21:53:15,891 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:53:15,892 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:53:15,892 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:53:15,893 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:53:15,893 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:53:15,893 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:53:15,893 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:53:15,893 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:53:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-11-15 21:53:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 21:53:15,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:15,936 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:15,940 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr52ASSERT_VIOLATIONMEMORY_FREE, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr51ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr53ENSURES_VIOLATIONMEMORY_LEAK, mainErr15REQUIRES_VIOLATION, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr38REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION]=== [2019-11-15 21:53:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:15,944 INFO L82 PathProgramCache]: Analyzing trace with hash -281744983, now seen corresponding path program 1 times [2019-11-15 21:53:15,953 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:53:15,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [583597333] [2019-11-15 21:53:15,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cca8c939-34a4-4da7-a8a6-0af484174f98/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:16,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:16,173 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 21:53:16,180 INFO L168 Benchmark]: Toolchain (without parser) took 2705.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -128.0 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:16,181 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:53:16,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 941.6 MB in the beginning and 1.2 GB in the end (delta: -209.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:16,185 INFO L168 Benchmark]: Boogie Preprocessor took 160.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:53:16,187 INFO L168 Benchmark]: RCFGBuilder took 1388.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:16,187 INFO L168 Benchmark]: TraceAbstraction took 359.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:53:16,198 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 792.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 941.6 MB in the beginning and 1.2 GB in the end (delta: -209.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 160.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1388.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 359.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...