./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/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 e6399ca05df7547b7620299987a8a06e9e2c006b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/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 e6399ca05df7547b7620299987a8a06e9e2c006b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 10:56:03,537 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 10:56:03,538 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 10:56:03,544 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 10:56:03,544 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 10:56:03,544 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 10:56:03,545 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 10:56:03,546 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 10:56:03,547 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 10:56:03,547 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 10:56:03,548 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 10:56:03,548 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 10:56:03,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 10:56:03,549 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 10:56:03,549 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 10:56:03,549 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 10:56:03,550 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 10:56:03,551 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 10:56:03,552 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 10:56:03,552 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 10:56:03,553 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 10:56:03,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 10:56:03,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 10:56:03,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 10:56:03,555 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 10:56:03,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 10:56:03,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 10:56:03,556 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 10:56:03,556 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 10:56:03,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 10:56:03,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 10:56:03,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 10:56:03,557 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 10:56:03,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 10:56:03,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 10:56:03,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 10:56:03,558 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-08 10:56:03,565 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 10:56:03,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 10:56:03,566 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 10:56:03,566 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 10:56:03,566 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 10:56:03,566 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 10:56:03,566 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 10:56:03,566 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 10:56:03,566 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 10:56:03,567 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 10:56:03,567 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 10:56:03,567 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 10:56:03,567 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 10:56:03,567 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 10:56:03,567 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 10:56:03,567 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 10:56:03,567 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 10:56:03,567 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 10:56:03,567 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 10:56:03,567 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 10:56:03,567 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 10:56:03,568 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 10:56:03,568 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 10:56:03,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 10:56:03,568 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 10:56:03,568 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 10:56:03,568 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 10:56:03,568 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 10:56:03,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/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 -> e6399ca05df7547b7620299987a8a06e9e2c006b [2018-12-08 10:56:03,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 10:56:03,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 10:56:03,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 10:56:03,594 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 10:56:03,594 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 10:56:03,595 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/../../sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-12-08 10:56:03,630 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/data/bdf7823c8/16f6d7516c9442fc93f9c55cee3c1e02/FLAG770e4b35c [2018-12-08 10:56:04,111 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 10:56:04,112 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-12-08 10:56:04,119 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/data/bdf7823c8/16f6d7516c9442fc93f9c55cee3c1e02/FLAG770e4b35c [2018-12-08 10:56:04,614 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/data/bdf7823c8/16f6d7516c9442fc93f9c55cee3c1e02 [2018-12-08 10:56:04,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 10:56:04,616 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 10:56:04,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 10:56:04,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 10:56:04,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 10:56:04,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:56:04" (1/1) ... [2018-12-08 10:56:04,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b06587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:56:04, skipping insertion in model container [2018-12-08 10:56:04,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:56:04" (1/1) ... [2018-12-08 10:56:04,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 10:56:04,644 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 10:56:04,798 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:56:04,805 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 10:56:04,867 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 10:56:04,889 INFO L195 MainTranslator]: Completed translation [2018-12-08 10:56:04,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:56:04 WrapperNode [2018-12-08 10:56:04,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 10:56:04,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 10:56:04,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 10:56:04,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 10:56:04,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:56:04" (1/1) ... [2018-12-08 10:56:04,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:56:04" (1/1) ... [2018-12-08 10:56:04,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:56:04" (1/1) ... [2018-12-08 10:56:04,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:56:04" (1/1) ... [2018-12-08 10:56:04,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:56:04" (1/1) ... [2018-12-08 10:56:04,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:56:04" (1/1) ... [2018-12-08 10:56:04,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:56:04" (1/1) ... [2018-12-08 10:56:04,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 10:56:04,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 10:56:04,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 10:56:04,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 10:56:04,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:56:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/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 [2018-12-08 10:56:04,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 10:56:04,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 10:56:04,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-08 10:56:04,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-08 10:56:04,965 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-12-08 10:56:04,966 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-12-08 10:56:04,966 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-12-08 10:56:04,966 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-12-08 10:56:04,966 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-12-08 10:56:04,966 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-12-08 10:56:04,966 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 10:56:04,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-08 10:56:04,966 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-08 10:56:04,966 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-08 10:56:04,966 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 10:56:04,966 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 10:56:04,966 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 10:56:04,966 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 10:56:04,966 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 10:56:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 10:56:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 10:56:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 10:56:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 10:56:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 10:56:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2018-12-08 10:56:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2018-12-08 10:56:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 10:56:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 10:56:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 10:56:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 10:56:05,447 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 10:56:05,448 INFO L280 CfgBuilder]: Removed 33 assue(true) statements. [2018-12-08 10:56:05,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:56:05 BoogieIcfgContainer [2018-12-08 10:56:05,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 10:56:05,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 10:56:05,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 10:56:05,451 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 10:56:05,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:56:04" (1/3) ... [2018-12-08 10:56:05,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f199726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:56:05, skipping insertion in model container [2018-12-08 10:56:05,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:56:04" (2/3) ... [2018-12-08 10:56:05,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f199726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:56:05, skipping insertion in model container [2018-12-08 10:56:05,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:56:05" (3/3) ... [2018-12-08 10:56:05,453 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_true-unreach-call_true-valid-memsafety.i [2018-12-08 10:56:05,459 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 10:56:05,464 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-12-08 10:56:05,474 INFO L257 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2018-12-08 10:56:05,489 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 10:56:05,489 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 10:56:05,489 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 10:56:05,490 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 10:56:05,490 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 10:56:05,490 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 10:56:05,490 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 10:56:05,490 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 10:56:05,490 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 10:56:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states. [2018-12-08 10:56:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 10:56:05,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:05,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:05,511 INFO L423 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:05,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:05,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1221642360, now seen corresponding path program 1 times [2018-12-08 10:56:05,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:05,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:05,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:05,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:05,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:05,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:56:05,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 10:56:05,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 10:56:05,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 10:56:05,599 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 2 states. [2018-12-08 10:56:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:05,617 INFO L93 Difference]: Finished difference Result 270 states and 295 transitions. [2018-12-08 10:56:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 10:56:05,618 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-08 10:56:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:05,626 INFO L225 Difference]: With dead ends: 270 [2018-12-08 10:56:05,626 INFO L226 Difference]: Without dead ends: 253 [2018-12-08 10:56:05,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 10:56:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-12-08 10:56:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-12-08 10:56:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-08 10:56:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2018-12-08 10:56:05,656 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 9 [2018-12-08 10:56:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:05,656 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2018-12-08 10:56:05,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 10:56:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2018-12-08 10:56:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 10:56:05,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:05,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:05,657 INFO L423 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:05,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash 782744891, now seen corresponding path program 1 times [2018-12-08 10:56:05,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:05,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:05,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:05,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:05,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:05,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:05,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:56:05,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:56:05,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:56:05,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:56:05,682 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand 3 states. [2018-12-08 10:56:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:05,853 INFO L93 Difference]: Finished difference Result 293 states and 315 transitions. [2018-12-08 10:56:05,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:56:05,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 10:56:05,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:05,855 INFO L225 Difference]: With dead ends: 293 [2018-12-08 10:56:05,855 INFO L226 Difference]: Without dead ends: 292 [2018-12-08 10:56:05,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:56:05,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-08 10:56:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 256. [2018-12-08 10:56:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-08 10:56:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 270 transitions. [2018-12-08 10:56:05,866 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 270 transitions. Word has length 10 [2018-12-08 10:56:05,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:05,866 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 270 transitions. [2018-12-08 10:56:05,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:56:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 270 transitions. [2018-12-08 10:56:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 10:56:05,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:05,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:05,867 INFO L423 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:05,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:05,867 INFO L82 PathProgramCache]: Analyzing trace with hash 782745869, now seen corresponding path program 1 times [2018-12-08 10:56:05,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:05,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:05,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:05,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:05,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:05,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:05,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:56:05,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:56:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:56:05,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:56:05,891 INFO L87 Difference]: Start difference. First operand 256 states and 270 transitions. Second operand 3 states. [2018-12-08 10:56:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:05,999 INFO L93 Difference]: Finished difference Result 271 states and 288 transitions. [2018-12-08 10:56:05,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:56:06,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 10:56:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:06,001 INFO L225 Difference]: With dead ends: 271 [2018-12-08 10:56:06,001 INFO L226 Difference]: Without dead ends: 271 [2018-12-08 10:56:06,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:56:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-08 10:56:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 254. [2018-12-08 10:56:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-08 10:56:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 268 transitions. [2018-12-08 10:56:06,011 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 268 transitions. Word has length 10 [2018-12-08 10:56:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:06,012 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 268 transitions. [2018-12-08 10:56:06,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:56:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 268 transitions. [2018-12-08 10:56:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 10:56:06,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:06,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:06,013 INFO L423 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:06,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash 782745870, now seen corresponding path program 1 times [2018-12-08 10:56:06,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:06,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:06,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:06,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:06,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:06,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:56:06,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:56:06,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:56:06,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:56:06,054 INFO L87 Difference]: Start difference. First operand 254 states and 268 transitions. Second operand 3 states. [2018-12-08 10:56:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:06,158 INFO L93 Difference]: Finished difference Result 279 states and 297 transitions. [2018-12-08 10:56:06,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:56:06,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 10:56:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:06,160 INFO L225 Difference]: With dead ends: 279 [2018-12-08 10:56:06,160 INFO L226 Difference]: Without dead ends: 279 [2018-12-08 10:56:06,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:56:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-08 10:56:06,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 252. [2018-12-08 10:56:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-08 10:56:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 266 transitions. [2018-12-08 10:56:06,167 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 266 transitions. Word has length 10 [2018-12-08 10:56:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:06,167 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 266 transitions. [2018-12-08 10:56:06,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:56:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 266 transitions. [2018-12-08 10:56:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 10:56:06,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:06,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:06,168 INFO L423 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:06,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash -199927265, now seen corresponding path program 1 times [2018-12-08 10:56:06,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:06,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:06,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 10:56:06,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:56:06,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:56:06,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:56:06,184 INFO L87 Difference]: Start difference. First operand 252 states and 266 transitions. Second operand 3 states. [2018-12-08 10:56:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:06,202 INFO L93 Difference]: Finished difference Result 267 states and 279 transitions. [2018-12-08 10:56:06,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:56:06,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-08 10:56:06,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:06,204 INFO L225 Difference]: With dead ends: 267 [2018-12-08 10:56:06,204 INFO L226 Difference]: Without dead ends: 266 [2018-12-08 10:56:06,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:56:06,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-08 10:56:06,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 251. [2018-12-08 10:56:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-08 10:56:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 264 transitions. [2018-12-08 10:56:06,210 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 264 transitions. Word has length 14 [2018-12-08 10:56:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:06,211 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 264 transitions. [2018-12-08 10:56:06,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:56:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 264 transitions. [2018-12-08 10:56:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 10:56:06,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:06,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:06,212 INFO L423 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:06,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:06,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1704137441, now seen corresponding path program 1 times [2018-12-08 10:56:06,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:06,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:06,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:06,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:06,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:06,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:56:06,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:56:06,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:56:06,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:56:06,239 INFO L87 Difference]: Start difference. First operand 251 states and 264 transitions. Second operand 3 states. [2018-12-08 10:56:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:06,340 INFO L93 Difference]: Finished difference Result 270 states and 285 transitions. [2018-12-08 10:56:06,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:56:06,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-08 10:56:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:06,341 INFO L225 Difference]: With dead ends: 270 [2018-12-08 10:56:06,341 INFO L226 Difference]: Without dead ends: 270 [2018-12-08 10:56:06,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:56:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-08 10:56:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 249. [2018-12-08 10:56:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-08 10:56:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 262 transitions. [2018-12-08 10:56:06,347 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 262 transitions. Word has length 15 [2018-12-08 10:56:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:06,347 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 262 transitions. [2018-12-08 10:56:06,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:56:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 262 transitions. [2018-12-08 10:56:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 10:56:06,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:06,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:06,348 INFO L423 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:06,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1704137442, now seen corresponding path program 1 times [2018-12-08 10:56:06,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:06,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:06,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:06,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:56:06,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:56:06,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:56:06,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:56:06,377 INFO L87 Difference]: Start difference. First operand 249 states and 262 transitions. Second operand 3 states. [2018-12-08 10:56:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:06,457 INFO L93 Difference]: Finished difference Result 278 states and 294 transitions. [2018-12-08 10:56:06,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:56:06,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-08 10:56:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:06,459 INFO L225 Difference]: With dead ends: 278 [2018-12-08 10:56:06,459 INFO L226 Difference]: Without dead ends: 278 [2018-12-08 10:56:06,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:56:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-08 10:56:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 247. [2018-12-08 10:56:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-08 10:56:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 260 transitions. [2018-12-08 10:56:06,464 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 260 transitions. Word has length 15 [2018-12-08 10:56:06,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:06,464 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 260 transitions. [2018-12-08 10:56:06,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:56:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 260 transitions. [2018-12-08 10:56:06,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 10:56:06,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:06,465 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:06,465 INFO L423 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:06,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:06,465 INFO L82 PathProgramCache]: Analyzing trace with hash 664751673, now seen corresponding path program 1 times [2018-12-08 10:56:06,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:06,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:06,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:06,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:06,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:06,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:56:06,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 10:56:06,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 10:56:06,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 10:56:06,496 INFO L87 Difference]: Start difference. First operand 247 states and 260 transitions. Second operand 4 states. [2018-12-08 10:56:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:06,532 INFO L93 Difference]: Finished difference Result 282 states and 298 transitions. [2018-12-08 10:56:06,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 10:56:06,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-08 10:56:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:06,533 INFO L225 Difference]: With dead ends: 282 [2018-12-08 10:56:06,533 INFO L226 Difference]: Without dead ends: 282 [2018-12-08 10:56:06,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:56:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-08 10:56:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 247. [2018-12-08 10:56:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-08 10:56:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 259 transitions. [2018-12-08 10:56:06,538 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 259 transitions. Word has length 21 [2018-12-08 10:56:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:06,538 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 259 transitions. [2018-12-08 10:56:06,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 10:56:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 259 transitions. [2018-12-08 10:56:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 10:56:06,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:06,539 INFO L402 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] [2018-12-08 10:56:06,539 INFO L423 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:06,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:06,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1799341027, now seen corresponding path program 1 times [2018-12-08 10:56:06,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:06,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:06,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:06,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:56:06,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:56:06,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:56:06,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:56:06,576 INFO L87 Difference]: Start difference. First operand 247 states and 259 transitions. Second operand 6 states. [2018-12-08 10:56:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:06,804 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2018-12-08 10:56:06,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:56:06,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-12-08 10:56:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:06,805 INFO L225 Difference]: With dead ends: 260 [2018-12-08 10:56:06,806 INFO L226 Difference]: Without dead ends: 260 [2018-12-08 10:56:06,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:56:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-08 10:56:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 240. [2018-12-08 10:56:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-12-08 10:56:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 254 transitions. [2018-12-08 10:56:06,809 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 254 transitions. Word has length 25 [2018-12-08 10:56:06,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:06,810 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 254 transitions. [2018-12-08 10:56:06,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:56:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 254 transitions. [2018-12-08 10:56:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 10:56:06,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:06,810 INFO L402 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] [2018-12-08 10:56:06,811 INFO L423 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:06,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:06,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1799341026, now seen corresponding path program 1 times [2018-12-08 10:56:06,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:06,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:06,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:06,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:06,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:06,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:56:06,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:56:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:56:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:56:06,869 INFO L87 Difference]: Start difference. First operand 240 states and 254 transitions. Second operand 6 states. [2018-12-08 10:56:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:07,106 INFO L93 Difference]: Finished difference Result 301 states and 317 transitions. [2018-12-08 10:56:07,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:56:07,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-12-08 10:56:07,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:07,107 INFO L225 Difference]: With dead ends: 301 [2018-12-08 10:56:07,107 INFO L226 Difference]: Without dead ends: 301 [2018-12-08 10:56:07,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:56:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-08 10:56:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 268. [2018-12-08 10:56:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 10:56:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 285 transitions. [2018-12-08 10:56:07,111 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 285 transitions. Word has length 25 [2018-12-08 10:56:07,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:07,111 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 285 transitions. [2018-12-08 10:56:07,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:56:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 285 transitions. [2018-12-08 10:56:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 10:56:07,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:07,111 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:07,112 INFO L423 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:07,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash 34413144, now seen corresponding path program 1 times [2018-12-08 10:56:07,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:07,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:07,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:07,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:07,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 10:56:07,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 10:56:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 10:56:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 10:56:07,217 INFO L87 Difference]: Start difference. First operand 268 states and 285 transitions. Second operand 10 states. [2018-12-08 10:56:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:07,648 INFO L93 Difference]: Finished difference Result 293 states and 309 transitions. [2018-12-08 10:56:07,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 10:56:07,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-08 10:56:07,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:07,649 INFO L225 Difference]: With dead ends: 293 [2018-12-08 10:56:07,649 INFO L226 Difference]: Without dead ends: 293 [2018-12-08 10:56:07,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-08 10:56:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-08 10:56:07,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 269. [2018-12-08 10:56:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-08 10:56:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 287 transitions. [2018-12-08 10:56:07,654 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 287 transitions. Word has length 36 [2018-12-08 10:56:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:07,654 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 287 transitions. [2018-12-08 10:56:07,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 10:56:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 287 transitions. [2018-12-08 10:56:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 10:56:07,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:07,655 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:07,656 INFO L423 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:07,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:07,656 INFO L82 PathProgramCache]: Analyzing trace with hash 34413145, now seen corresponding path program 1 times [2018-12-08 10:56:07,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:07,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:07,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:07,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:07,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:07,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:07,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 10:56:07,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 10:56:07,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 10:56:07,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:56:07,771 INFO L87 Difference]: Start difference. First operand 269 states and 287 transitions. Second operand 9 states. [2018-12-08 10:56:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:08,189 INFO L93 Difference]: Finished difference Result 292 states and 308 transitions. [2018-12-08 10:56:08,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:56:08,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-08 10:56:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:08,191 INFO L225 Difference]: With dead ends: 292 [2018-12-08 10:56:08,191 INFO L226 Difference]: Without dead ends: 292 [2018-12-08 10:56:08,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-08 10:56:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-12-08 10:56:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 269. [2018-12-08 10:56:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-08 10:56:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 286 transitions. [2018-12-08 10:56:08,195 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 286 transitions. Word has length 36 [2018-12-08 10:56:08,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:08,195 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 286 transitions. [2018-12-08 10:56:08,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 10:56:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 286 transitions. [2018-12-08 10:56:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 10:56:08,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:08,196 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:08,196 INFO L423 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:08,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2127903738, now seen corresponding path program 1 times [2018-12-08 10:56:08,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:08,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:08,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:08,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:08,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:08,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:08,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 10:56:08,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 10:56:08,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 10:56:08,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 10:56:08,315 INFO L87 Difference]: Start difference. First operand 269 states and 286 transitions. Second operand 10 states. [2018-12-08 10:56:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:08,755 INFO L93 Difference]: Finished difference Result 291 states and 307 transitions. [2018-12-08 10:56:08,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 10:56:08,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-08 10:56:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:08,757 INFO L225 Difference]: With dead ends: 291 [2018-12-08 10:56:08,757 INFO L226 Difference]: Without dead ends: 291 [2018-12-08 10:56:08,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-12-08 10:56:08,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-08 10:56:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 269. [2018-12-08 10:56:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-08 10:56:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 285 transitions. [2018-12-08 10:56:08,760 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 285 transitions. Word has length 36 [2018-12-08 10:56:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:08,760 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 285 transitions. [2018-12-08 10:56:08,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 10:56:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 285 transitions. [2018-12-08 10:56:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 10:56:08,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:08,761 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:08,761 INFO L423 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:08,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:08,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2127903739, now seen corresponding path program 1 times [2018-12-08 10:56:08,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:08,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:08,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:08,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:08,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:08,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:08,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 10:56:08,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 10:56:08,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 10:56:08,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:56:08,853 INFO L87 Difference]: Start difference. First operand 269 states and 285 transitions. Second operand 8 states. [2018-12-08 10:56:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:09,241 INFO L93 Difference]: Finished difference Result 290 states and 306 transitions. [2018-12-08 10:56:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:56:09,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-08 10:56:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:09,243 INFO L225 Difference]: With dead ends: 290 [2018-12-08 10:56:09,243 INFO L226 Difference]: Without dead ends: 290 [2018-12-08 10:56:09,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:56:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-08 10:56:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 269. [2018-12-08 10:56:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-08 10:56:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 284 transitions. [2018-12-08 10:56:09,249 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 284 transitions. Word has length 36 [2018-12-08 10:56:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:09,249 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 284 transitions. [2018-12-08 10:56:09,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 10:56:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 284 transitions. [2018-12-08 10:56:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 10:56:09,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:09,250 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:09,250 INFO L423 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:09,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash -627690379, now seen corresponding path program 1 times [2018-12-08 10:56:09,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:09,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:09,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:09,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:09,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:09,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:56:09,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:56:09,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:09,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:09,514 INFO L478 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 13 treesize of output 10 [2018-12-08 10:56:09,516 INFO L478 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 10 treesize of output 9 [2018-12-08 10:56:09,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:09,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:09,523 INFO L478 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 13 treesize of output 10 [2018-12-08 10:56:09,524 INFO L478 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 10 treesize of output 9 [2018-12-08 10:56:09,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:09,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:09,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:09,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-12-08 10:56:09,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 10:56:09,563 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:56:09,564 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 10:56:09,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:09,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:09,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 10:56:09,574 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:56:09,574 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-08 10:56:09,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:09,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:09,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:09,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:10 [2018-12-08 10:56:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:09,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:56:09,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 15 [2018-12-08 10:56:09,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 10:56:09,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 10:56:09,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-12-08 10:56:09,623 INFO L87 Difference]: Start difference. First operand 269 states and 284 transitions. Second operand 15 states. [2018-12-08 10:56:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:09,878 INFO L93 Difference]: Finished difference Result 325 states and 344 transitions. [2018-12-08 10:56:09,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 10:56:09,878 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-12-08 10:56:09,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:09,880 INFO L225 Difference]: With dead ends: 325 [2018-12-08 10:56:09,880 INFO L226 Difference]: Without dead ends: 325 [2018-12-08 10:56:09,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-12-08 10:56:09,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-12-08 10:56:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 301. [2018-12-08 10:56:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-12-08 10:56:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 317 transitions. [2018-12-08 10:56:09,886 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 317 transitions. Word has length 41 [2018-12-08 10:56:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:09,886 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 317 transitions. [2018-12-08 10:56:09,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 10:56:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 317 transitions. [2018-12-08 10:56:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 10:56:09,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:09,887 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:09,887 INFO L423 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:09,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:09,888 INFO L82 PathProgramCache]: Analyzing trace with hash -501181479, now seen corresponding path program 1 times [2018-12-08 10:56:09,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:09,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:09,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:09,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:09,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:09,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:09,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:56:09,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:56:09,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:56:09,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:56:09,920 INFO L87 Difference]: Start difference. First operand 301 states and 317 transitions. Second operand 6 states. [2018-12-08 10:56:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:10,169 INFO L93 Difference]: Finished difference Result 322 states and 344 transitions. [2018-12-08 10:56:10,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:56:10,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-08 10:56:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:10,171 INFO L225 Difference]: With dead ends: 322 [2018-12-08 10:56:10,171 INFO L226 Difference]: Without dead ends: 322 [2018-12-08 10:56:10,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:56:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-08 10:56:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 301. [2018-12-08 10:56:10,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-12-08 10:56:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 319 transitions. [2018-12-08 10:56:10,177 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 319 transitions. Word has length 46 [2018-12-08 10:56:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:10,177 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 319 transitions. [2018-12-08 10:56:10,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:56:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 319 transitions. [2018-12-08 10:56:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 10:56:10,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:10,178 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:10,178 INFO L423 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:10,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:10,179 INFO L82 PathProgramCache]: Analyzing trace with hash -501181478, now seen corresponding path program 1 times [2018-12-08 10:56:10,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:10,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:10,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:10,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:10,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:56:10,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:56:10,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:56:10,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:56:10,227 INFO L87 Difference]: Start difference. First operand 301 states and 319 transitions. Second operand 6 states. [2018-12-08 10:56:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:10,478 INFO L93 Difference]: Finished difference Result 331 states and 353 transitions. [2018-12-08 10:56:10,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 10:56:10,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-12-08 10:56:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:10,480 INFO L225 Difference]: With dead ends: 331 [2018-12-08 10:56:10,480 INFO L226 Difference]: Without dead ends: 331 [2018-12-08 10:56:10,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:56:10,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-08 10:56:10,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 313. [2018-12-08 10:56:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-12-08 10:56:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 334 transitions. [2018-12-08 10:56:10,484 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 334 transitions. Word has length 46 [2018-12-08 10:56:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:10,484 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 334 transitions. [2018-12-08 10:56:10,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:56:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 334 transitions. [2018-12-08 10:56:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 10:56:10,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:10,484 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:10,485 INFO L423 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:10,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:10,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1578320400, now seen corresponding path program 1 times [2018-12-08 10:56:10,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:10,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:10,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:10,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:10,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:56:10,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:10,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 10:56:10,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 10:56:10,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 10:56:10,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 10:56:10,509 INFO L87 Difference]: Start difference. First operand 313 states and 334 transitions. Second operand 5 states. [2018-12-08 10:56:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:10,646 INFO L93 Difference]: Finished difference Result 310 states and 331 transitions. [2018-12-08 10:56:10,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 10:56:10,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-08 10:56:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:10,647 INFO L225 Difference]: With dead ends: 310 [2018-12-08 10:56:10,647 INFO L226 Difference]: Without dead ends: 310 [2018-12-08 10:56:10,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:56:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-08 10:56:10,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-12-08 10:56:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-08 10:56:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 331 transitions. [2018-12-08 10:56:10,651 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 331 transitions. Word has length 47 [2018-12-08 10:56:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:10,651 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 331 transitions. [2018-12-08 10:56:10,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 10:56:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 331 transitions. [2018-12-08 10:56:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 10:56:10,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:10,652 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:10,652 INFO L423 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:10,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1578320401, now seen corresponding path program 1 times [2018-12-08 10:56:10,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:10,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:10,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:10,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:10,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:10,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:10,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 10:56:10,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:56:10,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:56:10,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:56:10,693 INFO L87 Difference]: Start difference. First operand 310 states and 331 transitions. Second operand 6 states. [2018-12-08 10:56:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:10,905 INFO L93 Difference]: Finished difference Result 350 states and 371 transitions. [2018-12-08 10:56:10,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:56:10,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-08 10:56:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:10,906 INFO L225 Difference]: With dead ends: 350 [2018-12-08 10:56:10,906 INFO L226 Difference]: Without dead ends: 350 [2018-12-08 10:56:10,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:56:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-12-08 10:56:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 331. [2018-12-08 10:56:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-12-08 10:56:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 358 transitions. [2018-12-08 10:56:10,910 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 358 transitions. Word has length 47 [2018-12-08 10:56:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:10,910 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 358 transitions. [2018-12-08 10:56:10,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:56:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 358 transitions. [2018-12-08 10:56:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 10:56:10,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:10,910 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:10,910 INFO L423 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:10,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:10,911 INFO L82 PathProgramCache]: Analyzing trace with hash -183169795, now seen corresponding path program 1 times [2018-12-08 10:56:10,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:10,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:10,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:10,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:10,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:56:10,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 10:56:10,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 10:56:10,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 10:56:10,938 INFO L87 Difference]: Start difference. First operand 331 states and 358 transitions. Second operand 6 states. [2018-12-08 10:56:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:11,011 INFO L93 Difference]: Finished difference Result 375 states and 402 transitions. [2018-12-08 10:56:11,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 10:56:11,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-08 10:56:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:11,012 INFO L225 Difference]: With dead ends: 375 [2018-12-08 10:56:11,012 INFO L226 Difference]: Without dead ends: 372 [2018-12-08 10:56:11,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 10:56:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-12-08 10:56:11,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 338. [2018-12-08 10:56:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-12-08 10:56:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 366 transitions. [2018-12-08 10:56:11,018 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 366 transitions. Word has length 50 [2018-12-08 10:56:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:11,018 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 366 transitions. [2018-12-08 10:56:11,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 10:56:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 366 transitions. [2018-12-08 10:56:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 10:56:11,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:11,019 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:11,019 INFO L423 AbstractCegarLoop]: === Iteration 21 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:11,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:11,019 INFO L82 PathProgramCache]: Analyzing trace with hash -160230747, now seen corresponding path program 1 times [2018-12-08 10:56:11,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:11,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:11,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:11,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:11,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:11,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:56:11,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:56:11,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:11,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:11,205 INFO L478 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 13 treesize of output 10 [2018-12-08 10:56:11,206 INFO L478 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 10 treesize of output 9 [2018-12-08 10:56:11,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,221 INFO L478 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 13 treesize of output 10 [2018-12-08 10:56:11,222 INFO L478 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 10 treesize of output 9 [2018-12-08 10:56:11,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-12-08 10:56:11,272 INFO L478 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 11 [2018-12-08 10:56:11,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 10:56:11,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,290 INFO L478 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 11 [2018-12-08 10:56:11,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 10:56:11,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-08 10:56:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:11,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:56:11,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-12-08 10:56:11,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 10:56:11,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 10:56:11,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:56:11,327 INFO L87 Difference]: Start difference. First operand 338 states and 366 transitions. Second operand 12 states. [2018-12-08 10:56:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:11,593 INFO L93 Difference]: Finished difference Result 388 states and 417 transitions. [2018-12-08 10:56:11,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 10:56:11,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-12-08 10:56:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:11,594 INFO L225 Difference]: With dead ends: 388 [2018-12-08 10:56:11,594 INFO L226 Difference]: Without dead ends: 388 [2018-12-08 10:56:11,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-12-08 10:56:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-08 10:56:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 340. [2018-12-08 10:56:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-12-08 10:56:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2018-12-08 10:56:11,599 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 50 [2018-12-08 10:56:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:11,599 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2018-12-08 10:56:11,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 10:56:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2018-12-08 10:56:11,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 10:56:11,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:11,600 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:11,600 INFO L423 AbstractCegarLoop]: === Iteration 22 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:11,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:11,601 INFO L82 PathProgramCache]: Analyzing trace with hash -963902537, now seen corresponding path program 2 times [2018-12-08 10:56:11,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:11,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:11,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:11,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:11,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:11,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:56:11,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:56:11,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 10:56:11,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 10:56:11,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:56:11,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:11,799 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:56:11,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-08 10:56:11,819 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:56:11,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-08 10:56:11,852 INFO L478 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 13 treesize of output 10 [2018-12-08 10:56:11,853 INFO L478 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 10 treesize of output 9 [2018-12-08 10:56:11,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-12-08 10:56:11,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-08 10:56:11,971 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:56:11,972 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-08 10:56:11,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:11,980 INFO L267 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. [2018-12-08 10:56:11,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:11 [2018-12-08 10:56:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:12,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:56:12,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2018-12-08 10:56:12,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 10:56:12,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 10:56:12,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-08 10:56:12,016 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 21 states. [2018-12-08 10:56:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:12,997 INFO L93 Difference]: Finished difference Result 358 states and 387 transitions. [2018-12-08 10:56:12,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 10:56:12,998 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-12-08 10:56:12,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:12,999 INFO L225 Difference]: With dead ends: 358 [2018-12-08 10:56:12,999 INFO L226 Difference]: Without dead ends: 358 [2018-12-08 10:56:13,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2018-12-08 10:56:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-12-08 10:56:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 342. [2018-12-08 10:56:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-12-08 10:56:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 371 transitions. [2018-12-08 10:56:13,006 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 371 transitions. Word has length 52 [2018-12-08 10:56:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:13,007 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 371 transitions. [2018-12-08 10:56:13,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 10:56:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 371 transitions. [2018-12-08 10:56:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 10:56:13,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:13,008 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:13,008 INFO L423 AbstractCegarLoop]: === Iteration 23 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:13,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:13,009 INFO L82 PathProgramCache]: Analyzing trace with hash -963902536, now seen corresponding path program 1 times [2018-12-08 10:56:13,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:13,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:13,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:13,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:56:13,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:13,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:56:13,242 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:56:13,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:13,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:13,272 INFO L478 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 [2018-12-08 10:56:13,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 10:56:13,341 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:56:13,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,345 INFO L267 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. [2018-12-08 10:56:13,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-12-08 10:56:13,360 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:56:13,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-08 10:56:13,400 INFO L478 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 13 treesize of output 10 [2018-12-08 10:56:13,402 INFO L478 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 10 treesize of output 9 [2018-12-08 10:56:13,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,414 INFO L478 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 13 treesize of output 10 [2018-12-08 10:56:13,416 INFO L478 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 10 treesize of output 9 [2018-12-08 10:56:13,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,425 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:41 [2018-12-08 10:56:13,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-08 10:56:13,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-12-08 10:56:13,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 10:56:13,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-12-08 10:56:13,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:13,538 INFO L267 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. [2018-12-08 10:56:13,538 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:17 [2018-12-08 10:56:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:13,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:56:13,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2018-12-08 10:56:13,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-08 10:56:13,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-08 10:56:13,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-12-08 10:56:13,599 INFO L87 Difference]: Start difference. First operand 342 states and 371 transitions. Second operand 26 states. [2018-12-08 10:56:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:15,588 INFO L93 Difference]: Finished difference Result 413 states and 443 transitions. [2018-12-08 10:56:15,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 10:56:15,589 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2018-12-08 10:56:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:15,590 INFO L225 Difference]: With dead ends: 413 [2018-12-08 10:56:15,590 INFO L226 Difference]: Without dead ends: 413 [2018-12-08 10:56:15,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2018-12-08 10:56:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-12-08 10:56:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 365. [2018-12-08 10:56:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-08 10:56:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 396 transitions. [2018-12-08 10:56:15,594 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 396 transitions. Word has length 52 [2018-12-08 10:56:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:15,595 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 396 transitions. [2018-12-08 10:56:15,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-08 10:56:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 396 transitions. [2018-12-08 10:56:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 10:56:15,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:15,595 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:15,595 INFO L423 AbstractCegarLoop]: === Iteration 24 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:15,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash 530058779, now seen corresponding path program 1 times [2018-12-08 10:56:15,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:15,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:15,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:15,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:15,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:56:15,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:15,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 10:56:15,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 10:56:15,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 10:56:15,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 10:56:15,671 INFO L87 Difference]: Start difference. First operand 365 states and 396 transitions. Second operand 10 states. [2018-12-08 10:56:16,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:16,010 INFO L93 Difference]: Finished difference Result 402 states and 435 transitions. [2018-12-08 10:56:16,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 10:56:16,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-08 10:56:16,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:16,011 INFO L225 Difference]: With dead ends: 402 [2018-12-08 10:56:16,011 INFO L226 Difference]: Without dead ends: 402 [2018-12-08 10:56:16,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-12-08 10:56:16,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-08 10:56:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 392. [2018-12-08 10:56:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-08 10:56:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 428 transitions. [2018-12-08 10:56:16,017 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 428 transitions. Word has length 56 [2018-12-08 10:56:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:16,017 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 428 transitions. [2018-12-08 10:56:16,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 10:56:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 428 transitions. [2018-12-08 10:56:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 10:56:16,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:16,018 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:16,019 INFO L423 AbstractCegarLoop]: === Iteration 25 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:16,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:16,019 INFO L82 PathProgramCache]: Analyzing trace with hash 530058780, now seen corresponding path program 1 times [2018-12-08 10:56:16,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:16,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:16,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:16,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:16,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:16,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 10:56:16,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 10:56:16,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 10:56:16,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-08 10:56:16,131 INFO L87 Difference]: Start difference. First operand 392 states and 428 transitions. Second operand 13 states. [2018-12-08 10:56:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:16,636 INFO L93 Difference]: Finished difference Result 434 states and 468 transitions. [2018-12-08 10:56:16,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 10:56:16,636 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-12-08 10:56:16,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:16,637 INFO L225 Difference]: With dead ends: 434 [2018-12-08 10:56:16,637 INFO L226 Difference]: Without dead ends: 434 [2018-12-08 10:56:16,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-12-08 10:56:16,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-12-08 10:56:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 395. [2018-12-08 10:56:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-12-08 10:56:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 431 transitions. [2018-12-08 10:56:16,642 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 431 transitions. Word has length 56 [2018-12-08 10:56:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:16,642 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 431 transitions. [2018-12-08 10:56:16,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 10:56:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 431 transitions. [2018-12-08 10:56:16,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 10:56:16,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:16,643 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:16,643 INFO L423 AbstractCegarLoop]: === Iteration 26 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:16,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1523161649, now seen corresponding path program 1 times [2018-12-08 10:56:16,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:16,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:16,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:16,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:16,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:56:16,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:16,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 10:56:16,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 10:56:16,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 10:56:16,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:56:16,756 INFO L87 Difference]: Start difference. First operand 395 states and 431 transitions. Second operand 12 states. [2018-12-08 10:56:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:17,221 INFO L93 Difference]: Finished difference Result 406 states and 438 transitions. [2018-12-08 10:56:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 10:56:17,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-12-08 10:56:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:17,223 INFO L225 Difference]: With dead ends: 406 [2018-12-08 10:56:17,223 INFO L226 Difference]: Without dead ends: 406 [2018-12-08 10:56:17,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-12-08 10:56:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-12-08 10:56:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 389. [2018-12-08 10:56:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-12-08 10:56:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 419 transitions. [2018-12-08 10:56:17,228 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 419 transitions. Word has length 60 [2018-12-08 10:56:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:17,229 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 419 transitions. [2018-12-08 10:56:17,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 10:56:17,229 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 419 transitions. [2018-12-08 10:56:17,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 10:56:17,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:17,229 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:17,230 INFO L423 AbstractCegarLoop]: === Iteration 27 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:17,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:17,230 INFO L82 PathProgramCache]: Analyzing trace with hash 193285539, now seen corresponding path program 2 times [2018-12-08 10:56:17,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:17,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:17,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:17,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:17,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:17,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:56:17,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:56:17,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 10:56:17,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 10:56:17,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:56:17,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:17,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 10:56:17,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-08 10:56:17,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:17,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:17,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 10:56:17,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-08 10:56:17,543 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:17,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:17,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:17,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-12-08 10:56:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 10:56:17,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 10:56:17,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2018-12-08 10:56:17,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-08 10:56:17,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-08 10:56:17,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-12-08 10:56:17,596 INFO L87 Difference]: Start difference. First operand 389 states and 419 transitions. Second operand 22 states. [2018-12-08 10:56:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:18,483 INFO L93 Difference]: Finished difference Result 428 states and 457 transitions. [2018-12-08 10:56:18,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 10:56:18,484 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-12-08 10:56:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:18,485 INFO L225 Difference]: With dead ends: 428 [2018-12-08 10:56:18,485 INFO L226 Difference]: Without dead ends: 414 [2018-12-08 10:56:18,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2018-12-08 10:56:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-12-08 10:56:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 373. [2018-12-08 10:56:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-08 10:56:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 401 transitions. [2018-12-08 10:56:18,490 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 401 transitions. Word has length 61 [2018-12-08 10:56:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:18,490 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 401 transitions. [2018-12-08 10:56:18,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-08 10:56:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 401 transitions. [2018-12-08 10:56:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 10:56:18,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:18,491 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:18,491 INFO L423 AbstractCegarLoop]: === Iteration 28 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:18,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:18,492 INFO L82 PathProgramCache]: Analyzing trace with hash 197947006, now seen corresponding path program 1 times [2018-12-08 10:56:18,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:18,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:18,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:18,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:56:18,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:19,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:56:19,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:56:19,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:19,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:19,071 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:56:19,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-08 10:56:19,093 INFO L478 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 11 treesize of output 8 [2018-12-08 10:56:19,094 INFO L478 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 8 treesize of output 7 [2018-12-08 10:56:19,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 10:56:19,105 INFO L478 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 28 treesize of output 23 [2018-12-08 10:56:19,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,116 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-08 10:56:19,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-12-08 10:56:19,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-12-08 10:56:19,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-12-08 10:56:19,171 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-08 10:56:19,173 INFO L478 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 8 treesize of output 7 [2018-12-08 10:56:19,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-12-08 10:56:19,213 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-12-08 10:56:19,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,215 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:56:19,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,226 INFO L267 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. [2018-12-08 10:56:19,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:42 [2018-12-08 10:56:19,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2018-12-08 10:56:19,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,276 INFO L267 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. [2018-12-08 10:56:19,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:66 [2018-12-08 10:56:19,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 62 [2018-12-08 10:56:19,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-08 10:56:19,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:19,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:85 [2018-12-08 10:56:19,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 90 [2018-12-08 10:56:19,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:19,423 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 93 [2018-12-08 10:56:19,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:56:19,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,465 INFO L478 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 13 treesize of output 10 [2018-12-08 10:56:19,466 INFO L478 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 10 treesize of output 9 [2018-12-08 10:56:19,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,483 INFO L267 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. [2018-12-08 10:56:19,483 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:121 [2018-12-08 10:56:19,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 10:56:19,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-08 10:56:19,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:19,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:20,004 INFO L267 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. [2018-12-08 10:56:20,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:124 [2018-12-08 10:56:20,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:20,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:20,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 88 [2018-12-08 10:56:20,207 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 59 [2018-12-08 10:56:20,210 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-12-08 10:56:20,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 10:56:20,241 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:20,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 47 treesize of output 36 [2018-12-08 10:56:20,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:20,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2018-12-08 10:56:20,274 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 10:56:20,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:20,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-12-08 10:56:20,277 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:20,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:56:20,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:56:20,337 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:125, output treesize:124 [2018-12-08 10:56:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:20,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:56:20,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2018-12-08 10:56:20,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-08 10:56:20,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-08 10:56:20,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2018-12-08 10:56:20,454 INFO L87 Difference]: Start difference. First operand 373 states and 401 transitions. Second operand 36 states. [2018-12-08 10:56:21,325 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2018-12-08 10:56:22,093 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-12-08 10:56:22,485 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2018-12-08 10:56:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:25,867 INFO L93 Difference]: Finished difference Result 401 states and 427 transitions. [2018-12-08 10:56:25,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 10:56:25,868 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 63 [2018-12-08 10:56:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:25,868 INFO L225 Difference]: With dead ends: 401 [2018-12-08 10:56:25,868 INFO L226 Difference]: Without dead ends: 401 [2018-12-08 10:56:25,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=378, Invalid=2484, Unknown=0, NotChecked=0, Total=2862 [2018-12-08 10:56:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-12-08 10:56:25,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 374. [2018-12-08 10:56:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-12-08 10:56:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 403 transitions. [2018-12-08 10:56:25,872 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 403 transitions. Word has length 63 [2018-12-08 10:56:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:25,872 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 403 transitions. [2018-12-08 10:56:25,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-08 10:56:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 403 transitions. [2018-12-08 10:56:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 10:56:25,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:25,873 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:25,873 INFO L423 AbstractCegarLoop]: === Iteration 29 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:25,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:25,873 INFO L82 PathProgramCache]: Analyzing trace with hash 197947007, now seen corresponding path program 1 times [2018-12-08 10:56:25,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:25,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:25,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:25,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:25,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:26,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:56:26,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:56:26,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:26,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:26,602 INFO L478 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 [2018-12-08 10:56:26,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 10:56:26,626 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:56:26,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,635 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:56:26,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-12-08 10:56:26,665 INFO L478 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 11 treesize of output 8 [2018-12-08 10:56:26,666 INFO L478 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 8 treesize of output 7 [2018-12-08 10:56:26,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,677 INFO L478 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 11 treesize of output 8 [2018-12-08 10:56:26,679 INFO L478 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 8 treesize of output 7 [2018-12-08 10:56:26,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,687 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-12-08 10:56:26,714 INFO L478 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 32 treesize of output 25 [2018-12-08 10:56:26,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:26,718 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-12-08 10:56:26,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,740 INFO L478 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 21 treesize of output 16 [2018-12-08 10:56:26,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:26,744 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 10:56:26,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,758 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:42 [2018-12-08 10:56:26,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:26,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:26,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2018-12-08 10:56:26,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:26,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:26,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:26,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-12-08 10:56:26,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:64 [2018-12-08 10:56:26,854 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-12-08 10:56:26,855 INFO L478 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 8 treesize of output 7 [2018-12-08 10:56:26,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,879 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 10:56:26,881 INFO L478 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 8 treesize of output 7 [2018-12-08 10:56:26,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,897 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:78 [2018-12-08 10:56:26,952 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-12-08 10:56:26,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:26,956 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:56:26,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:26,993 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-08 10:56:26,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:26,996 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:56:26,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,013 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:78 [2018-12-08 10:56:27,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-12-08 10:56:27,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 53 [2018-12-08 10:56:27,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:83 [2018-12-08 10:56:27,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-08 10:56:27,105 INFO L478 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 8 treesize of output 7 [2018-12-08 10:56:27,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 62 [2018-12-08 10:56:27,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-08 10:56:27,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:114 [2018-12-08 10:56:27,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 107 [2018-12-08 10:56:27,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,246 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 112 [2018-12-08 10:56:27,247 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:56:27,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 70 [2018-12-08 10:56:27,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,307 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-12-08 10:56:27,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:140, output treesize:186 [2018-12-08 10:56:27,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 163 [2018-12-08 10:56:27,730 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 102 [2018-12-08 10:56:27,732 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-12-08 10:56:27,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 97 [2018-12-08 10:56:27,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 10:56:27,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 108 treesize of output 73 [2018-12-08 10:56:27,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:27,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 91 [2018-12-08 10:56:27,796 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-08 10:56:27,853 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:56:27,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 75 [2018-12-08 10:56:27,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 10:56:27,943 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-12-08 10:56:27,955 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-08 10:56:27,966 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,974 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 79 [2018-12-08 10:56:27,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 10:56:27,979 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:27,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2018-12-08 10:56:27,992 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:28,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 10:56:28,004 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:28,016 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:28,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 79 [2018-12-08 10:56:28,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:28,024 INFO L478 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 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-08 10:56:28,024 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:28,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 10:56:28,039 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:28,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 10:56:28,051 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:28,061 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:28,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:56:28,094 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:224, output treesize:133 [2018-12-08 10:56:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:28,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:56:28,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2018-12-08 10:56:28,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-08 10:56:28,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-08 10:56:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2018-12-08 10:56:28,201 INFO L87 Difference]: Start difference. First operand 374 states and 403 transitions. Second operand 34 states. [2018-12-08 10:56:35,239 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2018-12-08 10:56:35,457 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 111 [2018-12-08 10:56:39,732 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 113 [2018-12-08 10:56:40,180 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2018-12-08 10:56:40,598 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-12-08 10:56:41,164 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 98 [2018-12-08 10:56:42,740 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 102 [2018-12-08 10:56:43,232 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 98 [2018-12-08 10:56:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:43,519 INFO L93 Difference]: Finished difference Result 424 states and 450 transitions. [2018-12-08 10:56:43,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 10:56:43,520 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 63 [2018-12-08 10:56:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:43,522 INFO L225 Difference]: With dead ends: 424 [2018-12-08 10:56:43,522 INFO L226 Difference]: Without dead ends: 424 [2018-12-08 10:56:43,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 48 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=367, Invalid=2285, Unknown=0, NotChecked=0, Total=2652 [2018-12-08 10:56:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-08 10:56:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 374. [2018-12-08 10:56:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-12-08 10:56:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 402 transitions. [2018-12-08 10:56:43,532 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 402 transitions. Word has length 63 [2018-12-08 10:56:43,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:43,532 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 402 transitions. [2018-12-08 10:56:43,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-08 10:56:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 402 transitions. [2018-12-08 10:56:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 10:56:43,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:43,533 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:43,534 INFO L423 AbstractCegarLoop]: === Iteration 30 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:43,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:43,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2003529696, now seen corresponding path program 1 times [2018-12-08 10:56:43,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:43,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:43,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:43,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:43,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:44,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:56:44,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:56:44,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:44,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:44,212 INFO L478 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 13 treesize of output 10 [2018-12-08 10:56:44,214 INFO L478 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 10 treesize of output 9 [2018-12-08 10:56:44,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,222 INFO L478 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 13 treesize of output 10 [2018-12-08 10:56:44,223 INFO L478 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 10 treesize of output 9 [2018-12-08 10:56:44,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,231 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-12-08 10:56:44,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:44,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:44,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 10:56:44,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:39 [2018-12-08 10:56:44,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 10:56:44,325 INFO L478 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 8 treesize of output 7 [2018-12-08 10:56:44,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 10:56:44,345 INFO L478 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 8 treesize of output 7 [2018-12-08 10:56:44,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-12-08 10:56:44,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-12-08 10:56:44,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:44,401 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:56:44,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-12-08 10:56:44,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:44,425 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:56:44,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,439 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2018-12-08 10:56:44,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:44,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:44,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:44,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 10:56:44,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:54 [2018-12-08 10:56:44,497 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-12-08 10:56:44,499 INFO L478 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 8 treesize of output 7 [2018-12-08 10:56:44,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,533 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-12-08 10:56:44,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 10:56:44,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:81 [2018-12-08 10:56:44,604 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2018-12-08 10:56:44,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:44,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 62 [2018-12-08 10:56:44,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,638 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-12-08 10:56:44,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:44,641 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-12-08 10:56:44,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,663 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:107, output treesize:129 [2018-12-08 10:56:44,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 111 [2018-12-08 10:56:44,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-08 10:56:44,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:44,993 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:56:44,994 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-08 10:56:44,994 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:45,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2018-12-08 10:56:45,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:45,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:45,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2018-12-08 10:56:45,029 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:56:45,029 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 10:56:45,029 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:45,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:45,039 INFO L478 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 33 treesize of output 18 [2018-12-08 10:56:45,039 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:45,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 10:56:45,045 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:45,048 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:45,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:45,055 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:168, output treesize:13 [2018-12-08 10:56:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:45,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:56:45,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2018-12-08 10:56:45,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-08 10:56:45,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-08 10:56:45,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1245, Unknown=2, NotChecked=0, Total=1332 [2018-12-08 10:56:45,117 INFO L87 Difference]: Start difference. First operand 374 states and 402 transitions. Second operand 37 states. [2018-12-08 10:56:46,311 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 99 [2018-12-08 10:56:46,777 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-12-08 10:56:47,478 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2018-12-08 10:56:47,776 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2018-12-08 10:56:48,179 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-12-08 10:56:48,550 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2018-12-08 10:56:49,450 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2018-12-08 10:56:49,714 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2018-12-08 10:56:50,216 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2018-12-08 10:56:50,731 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2018-12-08 10:56:53,544 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2018-12-08 10:56:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:54,926 INFO L93 Difference]: Finished difference Result 469 states and 500 transitions. [2018-12-08 10:56:54,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-08 10:56:54,926 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 63 [2018-12-08 10:56:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:54,927 INFO L225 Difference]: With dead ends: 469 [2018-12-08 10:56:54,927 INFO L226 Difference]: Without dead ends: 469 [2018-12-08 10:56:54,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=521, Invalid=5027, Unknown=2, NotChecked=0, Total=5550 [2018-12-08 10:56:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-12-08 10:56:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 422. [2018-12-08 10:56:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-08 10:56:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 450 transitions. [2018-12-08 10:56:54,932 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 450 transitions. Word has length 63 [2018-12-08 10:56:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:54,932 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 450 transitions. [2018-12-08 10:56:54,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-08 10:56:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 450 transitions. [2018-12-08 10:56:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 10:56:54,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:54,933 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:54,933 INFO L423 AbstractCegarLoop]: === Iteration 31 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:54,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:54,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1911634052, now seen corresponding path program 1 times [2018-12-08 10:56:54,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:54,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:54,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:54,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:54,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:55,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:55,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 10:56:55,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 10:56:55,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 10:56:55,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-12-08 10:56:55,024 INFO L87 Difference]: Start difference. First operand 422 states and 450 transitions. Second operand 14 states. [2018-12-08 10:56:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:55,544 INFO L93 Difference]: Finished difference Result 447 states and 475 transitions. [2018-12-08 10:56:55,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 10:56:55,545 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2018-12-08 10:56:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:55,545 INFO L225 Difference]: With dead ends: 447 [2018-12-08 10:56:55,545 INFO L226 Difference]: Without dead ends: 447 [2018-12-08 10:56:55,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-12-08 10:56:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-08 10:56:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 427. [2018-12-08 10:56:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-12-08 10:56:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 457 transitions. [2018-12-08 10:56:55,549 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 457 transitions. Word has length 68 [2018-12-08 10:56:55,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:55,549 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 457 transitions. [2018-12-08 10:56:55,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 10:56:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 457 transitions. [2018-12-08 10:56:55,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 10:56:55,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:55,549 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:55,550 INFO L423 AbstractCegarLoop]: === Iteration 32 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:55,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:55,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1911634051, now seen corresponding path program 1 times [2018-12-08 10:56:55,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:55,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:55,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:55,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:55,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 10:56:55,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 10:56:55,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 10:56:55,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-12-08 10:56:55,697 INFO L87 Difference]: Start difference. First operand 427 states and 457 transitions. Second operand 13 states. [2018-12-08 10:56:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:56,122 INFO L93 Difference]: Finished difference Result 470 states and 505 transitions. [2018-12-08 10:56:56,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 10:56:56,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-12-08 10:56:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:56,123 INFO L225 Difference]: With dead ends: 470 [2018-12-08 10:56:56,123 INFO L226 Difference]: Without dead ends: 470 [2018-12-08 10:56:56,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-12-08 10:56:56,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-08 10:56:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 432. [2018-12-08 10:56:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-12-08 10:56:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 463 transitions. [2018-12-08 10:56:56,129 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 463 transitions. Word has length 68 [2018-12-08 10:56:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:56,129 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 463 transitions. [2018-12-08 10:56:56,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 10:56:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 463 transitions. [2018-12-08 10:56:56,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 10:56:56,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:56,130 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:56,130 INFO L423 AbstractCegarLoop]: === Iteration 33 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:56,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:56,130 INFO L82 PathProgramCache]: Analyzing trace with hash 868885417, now seen corresponding path program 1 times [2018-12-08 10:56:56,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:56,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:56,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:56,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:56:56,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 10:56:56,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 10:56:56,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 10:56:56,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:56:56,222 INFO L87 Difference]: Start difference. First operand 432 states and 463 transitions. Second operand 12 states. [2018-12-08 10:56:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:56,442 INFO L93 Difference]: Finished difference Result 445 states and 473 transitions. [2018-12-08 10:56:56,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 10:56:56,443 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-12-08 10:56:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:56,444 INFO L225 Difference]: With dead ends: 445 [2018-12-08 10:56:56,444 INFO L226 Difference]: Without dead ends: 445 [2018-12-08 10:56:56,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-12-08 10:56:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-12-08 10:56:56,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 432. [2018-12-08 10:56:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-12-08 10:56:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 461 transitions. [2018-12-08 10:56:56,449 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 461 transitions. Word has length 69 [2018-12-08 10:56:56,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:56,449 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 461 transitions. [2018-12-08 10:56:56,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 10:56:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 461 transitions. [2018-12-08 10:56:56,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 10:56:56,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:56,450 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:56,450 INFO L423 AbstractCegarLoop]: === Iteration 34 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:56,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:56,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1934746416, now seen corresponding path program 1 times [2018-12-08 10:56:56,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:56,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:56,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:56,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:56,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:56,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:56:56,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:56:56,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:56,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:56,725 INFO L478 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 13 treesize of output 10 [2018-12-08 10:56:56,726 INFO L478 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 10 treesize of output 9 [2018-12-08 10:56:56,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:56,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:56,732 INFO L478 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 13 treesize of output 10 [2018-12-08 10:56:56,733 INFO L478 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 10 treesize of output 9 [2018-12-08 10:56:56,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:56,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:56,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:56,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:27, output treesize:1 [2018-12-08 10:56:56,893 INFO L478 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 53 treesize of output 50 [2018-12-08 10:56:56,894 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-12-08 10:56:56,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:56,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2018-12-08 10:56:56,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:56:56,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 26 [2018-12-08 10:56:56,925 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:56,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 10:56:56,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-08 10:56:56,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 10:56:56,959 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:56,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 10:56:56,963 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:56,966 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:56,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-08 10:56:56,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-08 10:56:56,972 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:56,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2018-12-08 10:56:56,985 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-08 10:56:56,995 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:57,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2018-12-08 10:56:57,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:57,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-12-08 10:56:57,003 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:57,013 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:57,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:57,020 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:69, output treesize:10 [2018-12-08 10:56:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:56:57,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:56:57,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2018-12-08 10:56:57,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-08 10:56:57,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-08 10:56:57,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=537, Unknown=1, NotChecked=0, Total=600 [2018-12-08 10:56:57,084 INFO L87 Difference]: Start difference. First operand 432 states and 461 transitions. Second operand 25 states. [2018-12-08 10:56:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:56:58,170 INFO L93 Difference]: Finished difference Result 450 states and 478 transitions. [2018-12-08 10:56:58,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 10:56:58,170 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2018-12-08 10:56:58,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:56:58,171 INFO L225 Difference]: With dead ends: 450 [2018-12-08 10:56:58,171 INFO L226 Difference]: Without dead ends: 450 [2018-12-08 10:56:58,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=1488, Unknown=1, NotChecked=0, Total=1722 [2018-12-08 10:56:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-08 10:56:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 436. [2018-12-08 10:56:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-12-08 10:56:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 465 transitions. [2018-12-08 10:56:58,174 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 465 transitions. Word has length 73 [2018-12-08 10:56:58,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:56:58,174 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 465 transitions. [2018-12-08 10:56:58,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-08 10:56:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 465 transitions. [2018-12-08 10:56:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 10:56:58,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:56:58,175 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:56:58,175 INFO L423 AbstractCegarLoop]: === Iteration 35 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:56:58,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:56:58,175 INFO L82 PathProgramCache]: Analyzing trace with hash 152402133, now seen corresponding path program 1 times [2018-12-08 10:56:58,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:56:58,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:56:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:58,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:56:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:56:58,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:56:58,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:56:58,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:56:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:56:58,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:56:58,415 INFO L478 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 11 treesize of output 8 [2018-12-08 10:56:58,417 INFO L478 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 8 treesize of output 7 [2018-12-08 10:56:58,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:58,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:58,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:58,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:41 [2018-12-08 10:56:58,447 INFO L478 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 48 treesize of output 39 [2018-12-08 10:56:58,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:58,450 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2018-12-08 10:56:58,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:58,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:58,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:58,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:41 [2018-12-08 10:56:58,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:58,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2018-12-08 10:56:58,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-08 10:56:58,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:58,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:58,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:58,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2018-12-08 10:56:58,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:56:58,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2018-12-08 10:56:58,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-08 10:56:58,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:56:58,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:56:58,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:56:58,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2018-12-08 10:56:58,649 INFO L478 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 42 treesize of output 34 [2018-12-08 10:56:58,662 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 31 [2018-12-08 10:56:58,662 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:56:58,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:56:58,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:56:58,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:62 [2018-12-08 10:57:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:57:03,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:57:03,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2018-12-08 10:57:03,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-08 10:57:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-08 10:57:03,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=485, Unknown=9, NotChecked=0, Total=552 [2018-12-08 10:57:03,670 INFO L87 Difference]: Start difference. First operand 436 states and 465 transitions. Second operand 24 states. [2018-12-08 10:57:08,281 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-08 10:57:08,521 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-08 10:57:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:09,277 INFO L93 Difference]: Finished difference Result 446 states and 473 transitions. [2018-12-08 10:57:09,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 10:57:09,278 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-12-08 10:57:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:09,279 INFO L225 Difference]: With dead ends: 446 [2018-12-08 10:57:09,279 INFO L226 Difference]: Without dead ends: 391 [2018-12-08 10:57:09,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=158, Invalid=1023, Unknown=9, NotChecked=0, Total=1190 [2018-12-08 10:57:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-12-08 10:57:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 383. [2018-12-08 10:57:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-12-08 10:57:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 411 transitions. [2018-12-08 10:57:09,282 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 411 transitions. Word has length 74 [2018-12-08 10:57:09,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:09,282 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 411 transitions. [2018-12-08 10:57:09,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-08 10:57:09,282 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 411 transitions. [2018-12-08 10:57:09,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 10:57:09,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:09,282 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:09,282 INFO L423 AbstractCegarLoop]: === Iteration 36 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:09,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:09,283 INFO L82 PathProgramCache]: Analyzing trace with hash 444506595, now seen corresponding path program 1 times [2018-12-08 10:57:09,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:09,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:09,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:09,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:09,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:57:10,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:57:10,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:57:10,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:10,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:57:10,264 INFO L478 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 [2018-12-08 10:57:10,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 10:57:10,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 10:57:10,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,298 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 10:57:10,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-12-08 10:57:10,331 INFO L478 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 11 treesize of output 8 [2018-12-08 10:57:10,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 10:57:10,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,345 INFO L478 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 11 treesize of output 8 [2018-12-08 10:57:10,346 INFO L478 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 8 treesize of output 7 [2018-12-08 10:57:10,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,356 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:50 [2018-12-08 10:57:10,385 INFO L478 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 31 [2018-12-08 10:57:10,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,391 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 42 [2018-12-08 10:57:10,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,413 INFO L478 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 21 treesize of output 16 [2018-12-08 10:57:10,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,416 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 10:57:10,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,430 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2018-12-08 10:57:10,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,463 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-12-08 10:57:10,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-12-08 10:57:10,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:72 [2018-12-08 10:57:10,546 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 10:57:10,548 INFO L478 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 8 treesize of output 7 [2018-12-08 10:57:10,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,571 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-12-08 10:57:10,572 INFO L478 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 8 treesize of output 7 [2018-12-08 10:57:10,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-12-08 10:57:10,644 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-08 10:57:10,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,648 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:57:10,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,676 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-12-08 10:57:10,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,679 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:57:10,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,700 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:124, output treesize:86 [2018-12-08 10:57:10,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 61 [2018-12-08 10:57:10,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-12-08 10:57:10,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:91 [2018-12-08 10:57:10,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-08 10:57:10,811 INFO L478 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 8 treesize of output 7 [2018-12-08 10:57:10,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2018-12-08 10:57:10,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-08 10:57:10,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:122 [2018-12-08 10:57:10,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2018-12-08 10:57:10,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,948 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-12-08 10:57:10,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:10,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:10,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 115 [2018-12-08 10:57:10,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:11,015 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 112 [2018-12-08 10:57:11,016 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:57:11,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,073 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:148, output treesize:212 [2018-12-08 10:57:11,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:11,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:11,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 179 [2018-12-08 10:57:11,492 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 114 [2018-12-08 10:57:11,494 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-12-08 10:57:11,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-08 10:57:11,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 77 [2018-12-08 10:57:11,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:11,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 95 [2018-12-08 10:57:11,604 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 101 [2018-12-08 10:57:11,610 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-08 10:57:11,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 10:57:11,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2018-12-08 10:57:11,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:11,722 INFO L478 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 0 case distinctions, treesize of input 40 treesize of output 28 [2018-12-08 10:57:11,722 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:11,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 10:57:11,739 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 10:57:11,753 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,764 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2018-12-08 10:57:11,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-12-08 10:57:11,769 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:11,783 INFO L478 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 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-08 10:57:11,784 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:11,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 10:57:11,797 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,806 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2018-12-08 10:57:11,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-12-08 10:57:11,811 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 10:57:11,825 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-08 10:57:11,839 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,847 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:11,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 10:57:11,881 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:250, output treesize:145 [2018-12-08 10:57:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:57:11,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:57:11,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 37 [2018-12-08 10:57:11,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-08 10:57:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-08 10:57:11,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1296, Unknown=0, NotChecked=0, Total=1406 [2018-12-08 10:57:11,997 INFO L87 Difference]: Start difference. First operand 383 states and 411 transitions. Second operand 38 states. [2018-12-08 10:57:13,011 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2018-12-08 10:57:13,241 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 118 [2018-12-08 10:57:13,485 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 120 [2018-12-08 10:57:13,884 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-12-08 10:57:14,760 WARN L180 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2018-12-08 10:57:15,323 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-12-08 10:57:15,609 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-12-08 10:57:19,110 WARN L180 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 106 [2018-12-08 10:57:20,062 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 106 [2018-12-08 10:57:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:20,241 INFO L93 Difference]: Finished difference Result 401 states and 427 transitions. [2018-12-08 10:57:20,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 10:57:20,242 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-08 10:57:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:20,243 INFO L225 Difference]: With dead ends: 401 [2018-12-08 10:57:20,243 INFO L226 Difference]: Without dead ends: 401 [2018-12-08 10:57:20,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=402, Invalid=2678, Unknown=0, NotChecked=0, Total=3080 [2018-12-08 10:57:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-12-08 10:57:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 383. [2018-12-08 10:57:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-12-08 10:57:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 410 transitions. [2018-12-08 10:57:20,248 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 410 transitions. Word has length 74 [2018-12-08 10:57:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:20,248 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 410 transitions. [2018-12-08 10:57:20,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-08 10:57:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 410 transitions. [2018-12-08 10:57:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 10:57:20,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:20,249 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:20,249 INFO L423 AbstractCegarLoop]: === Iteration 37 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:20,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:20,250 INFO L82 PathProgramCache]: Analyzing trace with hash -614388661, now seen corresponding path program 1 times [2018-12-08 10:57:20,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:20,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:20,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:20,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:20,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:57:20,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:57:20,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:57:20,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:20,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:57:20,523 INFO L478 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 13 treesize of output 10 [2018-12-08 10:57:20,524 INFO L478 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 10 treesize of output 9 [2018-12-08 10:57:20,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:20,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:20,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:20,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-12-08 10:57:20,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-08 10:57:20,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-12-08 10:57:20,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:20,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:20,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:20,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-12-08 10:57:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 10:57:20,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:57:20,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 22 [2018-12-08 10:57:20,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-08 10:57:20,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-08 10:57:20,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-12-08 10:57:20,648 INFO L87 Difference]: Start difference. First operand 383 states and 410 transitions. Second operand 23 states. [2018-12-08 10:57:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:21,283 INFO L93 Difference]: Finished difference Result 391 states and 419 transitions. [2018-12-08 10:57:21,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 10:57:21,283 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2018-12-08 10:57:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:21,284 INFO L225 Difference]: With dead ends: 391 [2018-12-08 10:57:21,284 INFO L226 Difference]: Without dead ends: 391 [2018-12-08 10:57:21,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2018-12-08 10:57:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-12-08 10:57:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 383. [2018-12-08 10:57:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-12-08 10:57:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 411 transitions. [2018-12-08 10:57:21,287 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 411 transitions. Word has length 77 [2018-12-08 10:57:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:21,288 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 411 transitions. [2018-12-08 10:57:21,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-08 10:57:21,288 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 411 transitions. [2018-12-08 10:57:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 10:57:21,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:21,288 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:21,288 INFO L423 AbstractCegarLoop]: === Iteration 38 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:21,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:21,289 INFO L82 PathProgramCache]: Analyzing trace with hash -614388660, now seen corresponding path program 1 times [2018-12-08 10:57:21,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:21,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:21,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:21,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:21,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:57:21,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:57:21,671 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:57:21,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:21,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:57:21,779 INFO L478 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 13 treesize of output 10 [2018-12-08 10:57:21,780 INFO L478 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 10 treesize of output 9 [2018-12-08 10:57:21,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:21,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:21,789 INFO L478 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 13 treesize of output 10 [2018-12-08 10:57:21,790 INFO L478 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 10 treesize of output 9 [2018-12-08 10:57:21,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:21,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:21,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:21,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2018-12-08 10:57:22,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-08 10:57:22,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-12-08 10:57:22,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:22,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:22,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 10:57:22,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-12-08 10:57:22,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:22,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:22,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:22,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:18 [2018-12-08 10:57:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:57:22,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:57:22,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 37 [2018-12-08 10:57:22,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-08 10:57:22,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-08 10:57:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2018-12-08 10:57:22,476 INFO L87 Difference]: Start difference. First operand 383 states and 411 transitions. Second operand 38 states. [2018-12-08 10:57:23,141 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-12-08 10:57:23,887 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-12-08 10:57:24,319 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-12-08 10:57:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:26,346 INFO L93 Difference]: Finished difference Result 409 states and 433 transitions. [2018-12-08 10:57:26,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 10:57:26,346 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 77 [2018-12-08 10:57:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:26,347 INFO L225 Difference]: With dead ends: 409 [2018-12-08 10:57:26,347 INFO L226 Difference]: Without dead ends: 409 [2018-12-08 10:57:26,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=348, Invalid=2622, Unknown=0, NotChecked=0, Total=2970 [2018-12-08 10:57:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-12-08 10:57:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 383. [2018-12-08 10:57:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-12-08 10:57:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 410 transitions. [2018-12-08 10:57:26,352 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 410 transitions. Word has length 77 [2018-12-08 10:57:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:26,352 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 410 transitions. [2018-12-08 10:57:26,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-08 10:57:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 410 transitions. [2018-12-08 10:57:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 10:57:26,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:26,353 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:26,353 INFO L423 AbstractCegarLoop]: === Iteration 39 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:26,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:26,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1898560291, now seen corresponding path program 1 times [2018-12-08 10:57:26,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:26,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:26,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:26,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:26,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 10:57:26,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:57:26,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:57:26,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:57:26,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:57:26,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:57:26,378 INFO L87 Difference]: Start difference. First operand 383 states and 410 transitions. Second operand 3 states. [2018-12-08 10:57:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:26,439 INFO L93 Difference]: Finished difference Result 382 states and 409 transitions. [2018-12-08 10:57:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:57:26,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-08 10:57:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:26,440 INFO L225 Difference]: With dead ends: 382 [2018-12-08 10:57:26,440 INFO L226 Difference]: Without dead ends: 382 [2018-12-08 10:57:26,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:57:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-12-08 10:57:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-12-08 10:57:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-08 10:57:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 409 transitions. [2018-12-08 10:57:26,443 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 409 transitions. Word has length 80 [2018-12-08 10:57:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:26,443 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 409 transitions. [2018-12-08 10:57:26,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:57:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 409 transitions. [2018-12-08 10:57:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 10:57:26,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:26,444 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:26,444 INFO L423 AbstractCegarLoop]: === Iteration 40 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:26,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:26,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1898560292, now seen corresponding path program 1 times [2018-12-08 10:57:26,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:26,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:26,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:26,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:26,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 10:57:26,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:57:26,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:57:26,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:57:26,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:57:26,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:57:26,466 INFO L87 Difference]: Start difference. First operand 382 states and 409 transitions. Second operand 3 states. [2018-12-08 10:57:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:26,536 INFO L93 Difference]: Finished difference Result 381 states and 408 transitions. [2018-12-08 10:57:26,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:57:26,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-12-08 10:57:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:26,537 INFO L225 Difference]: With dead ends: 381 [2018-12-08 10:57:26,537 INFO L226 Difference]: Without dead ends: 381 [2018-12-08 10:57:26,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:57:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-12-08 10:57:26,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-12-08 10:57:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-12-08 10:57:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 408 transitions. [2018-12-08 10:57:26,540 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 408 transitions. Word has length 80 [2018-12-08 10:57:26,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:26,540 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 408 transitions. [2018-12-08 10:57:26,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:57:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 408 transitions. [2018-12-08 10:57:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 10:57:26,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:26,541 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:26,541 INFO L423 AbstractCegarLoop]: === Iteration 41 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:26,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:26,541 INFO L82 PathProgramCache]: Analyzing trace with hash 99106701, now seen corresponding path program 3 times [2018-12-08 10:57:26,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:26,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:26,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:26,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:26,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:57:27,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:57:27,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:57:27,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 10:57:27,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 10:57:27,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:57:27,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:57:27,261 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:57:27,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-08 10:57:27,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:27,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:27,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 10:57:27,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-12-08 10:57:27,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-12-08 10:57:27,355 INFO L478 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 13 treesize of output 10 [2018-12-08 10:57:27,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-08 10:57:27,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:27,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:38 [2018-12-08 10:57:27,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:27,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:27,440 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:27,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-12-08 10:57:27,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,455 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 10:57:27,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,466 INFO L267 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. [2018-12-08 10:57:27,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:62 [2018-12-08 10:57:27,518 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-12-08 10:57:27,519 INFO L478 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 8 treesize of output 7 [2018-12-08 10:57:27,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,541 INFO L267 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. [2018-12-08 10:57:27,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-12-08 10:57:27,692 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-12-08 10:57:27,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:27,700 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:57:27,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:27,771 INFO L267 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. [2018-12-08 10:57:27,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:69 [2018-12-08 10:57:27,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:27,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:27,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-08 10:57:27,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:28,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:28,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:28,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:28,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:28,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 81 [2018-12-08 10:57:28,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:28,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:28,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:89, output treesize:100 [2018-12-08 10:57:28,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 69 [2018-12-08 10:57:28,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 10:57:28,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:28,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:28,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:28,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:114, output treesize:127 [2018-12-08 10:57:28,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:28,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 107 [2018-12-08 10:57:28,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:28,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 83 [2018-12-08 10:57:28,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:28,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:28,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:28,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:140, output treesize:171 [2018-12-08 10:57:29,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:29,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2018-12-08 10:57:29,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:29,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:29,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:187, output treesize:158 [2018-12-08 10:57:29,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:29,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:29,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 108 [2018-12-08 10:57:29,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 10:57:29,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:29,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2018-12-08 10:57:29,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:29,420 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:57:29,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2018-12-08 10:57:29,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:29,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:29,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:29,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:167, output treesize:45 [2018-12-08 10:57:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:57:29,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:57:29,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 46 [2018-12-08 10:57:29,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-08 10:57:29,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-08 10:57:29,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1990, Unknown=0, NotChecked=0, Total=2162 [2018-12-08 10:57:29,598 INFO L87 Difference]: Start difference. First operand 381 states and 408 transitions. Second operand 47 states. [2018-12-08 10:57:31,825 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2018-12-08 10:57:32,458 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 72 [2018-12-08 10:57:32,814 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 96 [2018-12-08 10:57:33,192 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 105 [2018-12-08 10:57:33,402 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 116 [2018-12-08 10:57:34,056 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2018-12-08 10:57:34,325 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2018-12-08 10:57:34,582 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2018-12-08 10:57:34,936 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 88 [2018-12-08 10:57:35,541 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 85 [2018-12-08 10:57:35,941 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 108 [2018-12-08 10:57:36,293 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-12-08 10:57:36,653 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 107 [2018-12-08 10:57:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:39,885 INFO L93 Difference]: Finished difference Result 413 states and 443 transitions. [2018-12-08 10:57:39,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-08 10:57:39,885 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 79 [2018-12-08 10:57:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:39,886 INFO L225 Difference]: With dead ends: 413 [2018-12-08 10:57:39,886 INFO L226 Difference]: Without dead ends: 413 [2018-12-08 10:57:39,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=736, Invalid=4964, Unknown=0, NotChecked=0, Total=5700 [2018-12-08 10:57:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-12-08 10:57:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 383. [2018-12-08 10:57:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-12-08 10:57:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 411 transitions. [2018-12-08 10:57:39,890 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 411 transitions. Word has length 79 [2018-12-08 10:57:39,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:39,890 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 411 transitions. [2018-12-08 10:57:39,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-08 10:57:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 411 transitions. [2018-12-08 10:57:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 10:57:39,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:39,891 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:39,891 INFO L423 AbstractCegarLoop]: === Iteration 42 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:39,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash 99106702, now seen corresponding path program 2 times [2018-12-08 10:57:39,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:39,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:39,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:39,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:57:39,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:57:41,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:57:41,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:57:41,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 10:57:41,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 10:57:41,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:57:41,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:57:41,553 INFO L478 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 [2018-12-08 10:57:41,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 10:57:41,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:41,583 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 10:57:41,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:41,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:41,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 10:57:41,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,594 INFO L267 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. [2018-12-08 10:57:41,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-12-08 10:57:41,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-08 10:57:41,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,630 INFO L267 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. [2018-12-08 10:57:41,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2018-12-08 10:57:41,687 INFO L478 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 13 treesize of output 10 [2018-12-08 10:57:41,688 INFO L478 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 10 treesize of output 9 [2018-12-08 10:57:41,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,702 INFO L478 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 13 treesize of output 10 [2018-12-08 10:57:41,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-08 10:57:41,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,705 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,714 INFO L267 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. [2018-12-08 10:57:41,714 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:52 [2018-12-08 10:57:41,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:41,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:41,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 10:57:41,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2018-12-08 10:57:41,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,836 INFO L267 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. [2018-12-08 10:57:41,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2018-12-08 10:57:41,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 10:57:41,894 INFO L478 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 8 treesize of output 7 [2018-12-08 10:57:41,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-08 10:57:41,921 INFO L478 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 8 treesize of output 7 [2018-12-08 10:57:41,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:41,937 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-12-08 10:57:42,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-12-08 10:57:42,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:42,013 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:57:42,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-12-08 10:57:42,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:42,055 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:57:42,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2018-12-08 10:57:42,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:42,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:42,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:42,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 10:57:42,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2018-12-08 10:57:42,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:71 [2018-12-08 10:57:42,223 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-12-08 10:57:42,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 10:57:42,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,273 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2018-12-08 10:57:42,274 INFO L478 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 8 treesize of output 7 [2018-12-08 10:57:42,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:102 [2018-12-08 10:57:42,362 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-12-08 10:57:42,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:42,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 71 [2018-12-08 10:57:42,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,403 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-12-08 10:57:42,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:42,406 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-12-08 10:57:42,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:42,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:128, output treesize:156 [2018-12-08 10:57:43,013 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:57:43,020 INFO L478 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 0 case distinctions, treesize of input 169 treesize of output 152 [2018-12-08 10:57:43,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-08 10:57:43,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:43,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:57:43,038 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:57:43,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 92 treesize of output 77 [2018-12-08 10:57:43,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:43,054 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:57:43,055 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-08 10:57:43,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:43,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:43,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-12-08 10:57:43,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 10:57:43,090 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:43,100 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 10:57:43,101 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-12-08 10:57:43,101 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:43,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-08 10:57:43,107 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:43,110 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:43,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 10:57:43,120 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:204, output treesize:36 [2018-12-08 10:57:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:57:43,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:57:43,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 44 [2018-12-08 10:57:43,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-08 10:57:43,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-08 10:57:43,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1812, Unknown=0, NotChecked=0, Total=1980 [2018-12-08 10:57:43,259 INFO L87 Difference]: Start difference. First operand 383 states and 411 transitions. Second operand 45 states. [2018-12-08 10:57:52,021 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 108 [2018-12-08 10:57:52,200 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 102 [2018-12-08 10:57:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:57,049 INFO L93 Difference]: Finished difference Result 458 states and 491 transitions. [2018-12-08 10:57:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-08 10:57:57,050 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 79 [2018-12-08 10:57:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:57,051 INFO L225 Difference]: With dead ends: 458 [2018-12-08 10:57:57,051 INFO L226 Difference]: Without dead ends: 458 [2018-12-08 10:57:57,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 61 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=675, Invalid=4155, Unknown=0, NotChecked=0, Total=4830 [2018-12-08 10:57:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-12-08 10:57:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 406. [2018-12-08 10:57:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-12-08 10:57:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 436 transitions. [2018-12-08 10:57:57,055 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 436 transitions. Word has length 79 [2018-12-08 10:57:57,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:57,056 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 436 transitions. [2018-12-08 10:57:57,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-08 10:57:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 436 transitions. [2018-12-08 10:57:57,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 10:57:57,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:57,056 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:57,056 INFO L423 AbstractCegarLoop]: === Iteration 43 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:57,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash -844651708, now seen corresponding path program 1 times [2018-12-08 10:57:57,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:57,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:57,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:57,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 10:57:57,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 10:57:57,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:57:57,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:57:57,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:57:57,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:57:57,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:57:57,075 INFO L87 Difference]: Start difference. First operand 406 states and 436 transitions. Second operand 3 states. [2018-12-08 10:57:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:57,138 INFO L93 Difference]: Finished difference Result 402 states and 432 transitions. [2018-12-08 10:57:57,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:57:57,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-08 10:57:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:57,140 INFO L225 Difference]: With dead ends: 402 [2018-12-08 10:57:57,140 INFO L226 Difference]: Without dead ends: 402 [2018-12-08 10:57:57,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:57:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-08 10:57:57,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2018-12-08 10:57:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-12-08 10:57:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 432 transitions. [2018-12-08 10:57:57,144 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 432 transitions. Word has length 82 [2018-12-08 10:57:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:57,144 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 432 transitions. [2018-12-08 10:57:57,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:57:57,145 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 432 transitions. [2018-12-08 10:57:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 10:57:57,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:57,145 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:57,145 INFO L423 AbstractCegarLoop]: === Iteration 44 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:57,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:57,146 INFO L82 PathProgramCache]: Analyzing trace with hash -844651707, now seen corresponding path program 1 times [2018-12-08 10:57:57,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:57,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:57,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:57,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:57,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 10:57:57,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:57:57,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:57:57,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:57:57,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:57:57,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:57:57,177 INFO L87 Difference]: Start difference. First operand 402 states and 432 transitions. Second operand 3 states. [2018-12-08 10:57:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:57,257 INFO L93 Difference]: Finished difference Result 398 states and 428 transitions. [2018-12-08 10:57:57,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:57:57,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-08 10:57:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:57,258 INFO L225 Difference]: With dead ends: 398 [2018-12-08 10:57:57,258 INFO L226 Difference]: Without dead ends: 398 [2018-12-08 10:57:57,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:57:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-12-08 10:57:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-12-08 10:57:57,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-12-08 10:57:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 428 transitions. [2018-12-08 10:57:57,261 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 428 transitions. Word has length 82 [2018-12-08 10:57:57,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:57,261 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 428 transitions. [2018-12-08 10:57:57,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:57:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 428 transitions. [2018-12-08 10:57:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 10:57:57,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:57,262 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:57,262 INFO L423 AbstractCegarLoop]: === Iteration 45 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:57,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:57,262 INFO L82 PathProgramCache]: Analyzing trace with hash 348776411, now seen corresponding path program 1 times [2018-12-08 10:57:57,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:57,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:57,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 10:57:57,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:57:57,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 10:57:57,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 10:57:57,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 10:57:57,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 10:57:57,291 INFO L87 Difference]: Start difference. First operand 398 states and 428 transitions. Second operand 7 states. [2018-12-08 10:57:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:57,475 INFO L93 Difference]: Finished difference Result 407 states and 438 transitions. [2018-12-08 10:57:57,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 10:57:57,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-08 10:57:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:57,476 INFO L225 Difference]: With dead ends: 407 [2018-12-08 10:57:57,476 INFO L226 Difference]: Without dead ends: 407 [2018-12-08 10:57:57,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:57:57,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-12-08 10:57:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 406. [2018-12-08 10:57:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-12-08 10:57:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 438 transitions. [2018-12-08 10:57:57,479 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 438 transitions. Word has length 82 [2018-12-08 10:57:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:57,480 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 438 transitions. [2018-12-08 10:57:57,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 10:57:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 438 transitions. [2018-12-08 10:57:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 10:57:57,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:57,480 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:57,481 INFO L423 AbstractCegarLoop]: === Iteration 46 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:57,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:57,481 INFO L82 PathProgramCache]: Analyzing trace with hash 348776412, now seen corresponding path program 1 times [2018-12-08 10:57:57,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:57,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:57,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 10:57:57,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:57:57,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 10:57:57,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 10:57:57,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 10:57:57,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 10:57:57,529 INFO L87 Difference]: Start difference. First operand 406 states and 438 transitions. Second operand 9 states. [2018-12-08 10:57:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:57,955 INFO L93 Difference]: Finished difference Result 461 states and 505 transitions. [2018-12-08 10:57:57,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 10:57:57,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-12-08 10:57:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:57,957 INFO L225 Difference]: With dead ends: 461 [2018-12-08 10:57:57,957 INFO L226 Difference]: Without dead ends: 461 [2018-12-08 10:57:57,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-12-08 10:57:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-08 10:57:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 414. [2018-12-08 10:57:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-12-08 10:57:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 452 transitions. [2018-12-08 10:57:57,962 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 452 transitions. Word has length 82 [2018-12-08 10:57:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:57,962 INFO L480 AbstractCegarLoop]: Abstraction has 414 states and 452 transitions. [2018-12-08 10:57:57,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 10:57:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 452 transitions. [2018-12-08 10:57:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 10:57:57,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:57,963 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:57,963 INFO L423 AbstractCegarLoop]: === Iteration 47 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:57,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:57,963 INFO L82 PathProgramCache]: Analyzing trace with hash -484846783, now seen corresponding path program 1 times [2018-12-08 10:57:57,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:57,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:57,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:57,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:57,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 10:57:58,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:57:58,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:57:58,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:58,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:57:58,066 INFO L478 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 13 treesize of output 10 [2018-12-08 10:57:58,067 INFO L478 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 10 treesize of output 9 [2018-12-08 10:57:58,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:58,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:58,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:58,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:1 [2018-12-08 10:57:58,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-08 10:57:58,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 10:57:58,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:58,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:58,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:58,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-08 10:57:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 10:57:58,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:57:58,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2018-12-08 10:57:58,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 10:57:58,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 10:57:58,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-08 10:57:58,112 INFO L87 Difference]: Start difference. First operand 414 states and 452 transitions. Second operand 12 states. [2018-12-08 10:57:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:57:58,440 INFO L93 Difference]: Finished difference Result 420 states and 454 transitions. [2018-12-08 10:57:58,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 10:57:58,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2018-12-08 10:57:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:57:58,441 INFO L225 Difference]: With dead ends: 420 [2018-12-08 10:57:58,441 INFO L226 Difference]: Without dead ends: 420 [2018-12-08 10:57:58,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-12-08 10:57:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-12-08 10:57:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 415. [2018-12-08 10:57:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-08 10:57:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 454 transitions. [2018-12-08 10:57:58,446 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 454 transitions. Word has length 83 [2018-12-08 10:57:58,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:57:58,446 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 454 transitions. [2018-12-08 10:57:58,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 10:57:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 454 transitions. [2018-12-08 10:57:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 10:57:58,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:57:58,447 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:57:58,448 INFO L423 AbstractCegarLoop]: === Iteration 48 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:57:58,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:57:58,448 INFO L82 PathProgramCache]: Analyzing trace with hash -484846782, now seen corresponding path program 1 times [2018-12-08 10:57:58,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:57:58,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:57:58,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:58,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:58,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:57:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:57:58,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:57:58,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:57:58,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:57:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:57:58,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:57:58,659 INFO L478 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 13 treesize of output 10 [2018-12-08 10:57:58,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-08 10:57:58,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:58,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:58,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:58,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-08 10:57:58,751 INFO L478 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 20 treesize of output 16 [2018-12-08 10:57:58,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 4 [2018-12-08 10:57:58,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:57:58,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:58,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:57:58,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:4 [2018-12-08 10:57:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:57:58,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:57:58,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-12-08 10:57:58,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-08 10:57:58,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-08 10:57:58,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-12-08 10:57:58,793 INFO L87 Difference]: Start difference. First operand 415 states and 454 transitions. Second operand 24 states. [2018-12-08 10:58:33,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:58:33,759 INFO L93 Difference]: Finished difference Result 390 states and 422 transitions. [2018-12-08 10:58:33,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-08 10:58:33,760 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 83 [2018-12-08 10:58:33,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:58:33,760 INFO L225 Difference]: With dead ends: 390 [2018-12-08 10:58:33,760 INFO L226 Difference]: Without dead ends: 390 [2018-12-08 10:58:33,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2018-12-08 10:58:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-12-08 10:58:33,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2018-12-08 10:58:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-12-08 10:58:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 415 transitions. [2018-12-08 10:58:33,764 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 415 transitions. Word has length 83 [2018-12-08 10:58:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:58:33,764 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 415 transitions. [2018-12-08 10:58:33,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-08 10:58:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 415 transitions. [2018-12-08 10:58:33,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 10:58:33,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:58:33,764 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:58:33,765 INFO L423 AbstractCegarLoop]: === Iteration 49 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:58:33,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:58:33,765 INFO L82 PathProgramCache]: Analyzing trace with hash 38537125, now seen corresponding path program 1 times [2018-12-08 10:58:33,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:58:33,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:58:33,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:58:33,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:58:33,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:58:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:58:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 10:58:33,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:58:33,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:58:33,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:58:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:58:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:58:33,783 INFO L87 Difference]: Start difference. First operand 384 states and 415 transitions. Second operand 3 states. [2018-12-08 10:58:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:58:33,839 INFO L93 Difference]: Finished difference Result 380 states and 411 transitions. [2018-12-08 10:58:33,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:58:33,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-08 10:58:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:58:33,840 INFO L225 Difference]: With dead ends: 380 [2018-12-08 10:58:33,840 INFO L226 Difference]: Without dead ends: 380 [2018-12-08 10:58:33,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:58:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-08 10:58:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-12-08 10:58:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-12-08 10:58:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 411 transitions. [2018-12-08 10:58:33,843 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 411 transitions. Word has length 84 [2018-12-08 10:58:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:58:33,843 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 411 transitions. [2018-12-08 10:58:33,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:58:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 411 transitions. [2018-12-08 10:58:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 10:58:33,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:58:33,844 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:58:33,844 INFO L423 AbstractCegarLoop]: === Iteration 50 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:58:33,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:58:33,844 INFO L82 PathProgramCache]: Analyzing trace with hash 38537126, now seen corresponding path program 1 times [2018-12-08 10:58:33,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:58:33,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:58:33,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:58:33,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:58:33,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:58:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:58:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 10:58:33,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:58:33,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 10:58:33,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 10:58:33,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 10:58:33,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:58:33,862 INFO L87 Difference]: Start difference. First operand 380 states and 411 transitions. Second operand 3 states. [2018-12-08 10:58:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:58:33,927 INFO L93 Difference]: Finished difference Result 376 states and 407 transitions. [2018-12-08 10:58:33,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 10:58:33,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-08 10:58:33,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:58:33,928 INFO L225 Difference]: With dead ends: 376 [2018-12-08 10:58:33,928 INFO L226 Difference]: Without dead ends: 376 [2018-12-08 10:58:33,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 10:58:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-12-08 10:58:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2018-12-08 10:58:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-08 10:58:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 407 transitions. [2018-12-08 10:58:33,932 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 407 transitions. Word has length 84 [2018-12-08 10:58:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:58:33,932 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 407 transitions. [2018-12-08 10:58:33,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 10:58:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 407 transitions. [2018-12-08 10:58:33,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 10:58:33,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:58:33,933 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:58:33,933 INFO L423 AbstractCegarLoop]: === Iteration 51 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:58:33,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:58:33,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1051835744, now seen corresponding path program 1 times [2018-12-08 10:58:33,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:58:33,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:58:33,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:58:33,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:58:33,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:58:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:58:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 10:58:34,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:58:34,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:58:34,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:58:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:58:34,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:58:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 10:58:34,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:58:34,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 18 [2018-12-08 10:58:34,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 10:58:34,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 10:58:34,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-12-08 10:58:34,175 INFO L87 Difference]: Start difference. First operand 376 states and 407 transitions. Second operand 19 states. [2018-12-08 10:58:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:58:45,063 INFO L93 Difference]: Finished difference Result 491 states and 530 transitions. [2018-12-08 10:58:45,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 10:58:45,063 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-12-08 10:58:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:58:45,064 INFO L225 Difference]: With dead ends: 491 [2018-12-08 10:58:45,064 INFO L226 Difference]: Without dead ends: 491 [2018-12-08 10:58:45,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2018-12-08 10:58:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-12-08 10:58:45,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 431. [2018-12-08 10:58:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-12-08 10:58:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 480 transitions. [2018-12-08 10:58:45,068 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 480 transitions. Word has length 87 [2018-12-08 10:58:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:58:45,068 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 480 transitions. [2018-12-08 10:58:45,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 10:58:45,068 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 480 transitions. [2018-12-08 10:58:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 10:58:45,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:58:45,069 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:58:45,069 INFO L423 AbstractCegarLoop]: === Iteration 52 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:58:45,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:58:45,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1817753269, now seen corresponding path program 1 times [2018-12-08 10:58:45,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:58:45,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:58:45,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:58:45,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:58:45,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:58:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:58:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 10:58:45,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 10:58:45,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 10:58:45,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 10:58:45,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 10:58:45,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-08 10:58:45,129 INFO L87 Difference]: Start difference. First operand 431 states and 480 transitions. Second operand 11 states. [2018-12-08 10:58:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:58:45,388 INFO L93 Difference]: Finished difference Result 547 states and 613 transitions. [2018-12-08 10:58:45,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 10:58:45,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2018-12-08 10:58:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:58:45,389 INFO L225 Difference]: With dead ends: 547 [2018-12-08 10:58:45,389 INFO L226 Difference]: Without dead ends: 547 [2018-12-08 10:58:45,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-08 10:58:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-12-08 10:58:45,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 450. [2018-12-08 10:58:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-08 10:58:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 517 transitions. [2018-12-08 10:58:45,394 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 517 transitions. Word has length 88 [2018-12-08 10:58:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:58:45,394 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 517 transitions. [2018-12-08 10:58:45,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 10:58:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 517 transitions. [2018-12-08 10:58:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 10:58:45,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:58:45,395 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:58:45,395 INFO L423 AbstractCegarLoop]: === Iteration 53 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:58:45,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:58:45,396 INFO L82 PathProgramCache]: Analyzing trace with hash -364248189, now seen corresponding path program 1 times [2018-12-08 10:58:45,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:58:45,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:58:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:58:45,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:58:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:58:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:58:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 10:58:45,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:58:45,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:58:45,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:58:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:58:45,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:58:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 10:58:45,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:58:45,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2018-12-08 10:58:45,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 10:58:45,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 10:58:45,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-08 10:58:45,525 INFO L87 Difference]: Start difference. First operand 450 states and 517 transitions. Second operand 11 states. [2018-12-08 10:58:45,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:58:45,686 INFO L93 Difference]: Finished difference Result 476 states and 520 transitions. [2018-12-08 10:58:45,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 10:58:45,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-12-08 10:58:45,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:58:45,688 INFO L225 Difference]: With dead ends: 476 [2018-12-08 10:58:45,688 INFO L226 Difference]: Without dead ends: 473 [2018-12-08 10:58:45,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-12-08 10:58:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-12-08 10:58:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 428. [2018-12-08 10:58:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-12-08 10:58:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 482 transitions. [2018-12-08 10:58:45,692 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 482 transitions. Word has length 91 [2018-12-08 10:58:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:58:45,692 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 482 transitions. [2018-12-08 10:58:45,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 10:58:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 482 transitions. [2018-12-08 10:58:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 10:58:45,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:58:45,693 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:58:45,693 INFO L423 AbstractCegarLoop]: === Iteration 54 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:58:45,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:58:45,694 INFO L82 PathProgramCache]: Analyzing trace with hash -341309141, now seen corresponding path program 1 times [2018-12-08 10:58:45,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:58:45,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:58:45,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:58:45,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:58:45,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:58:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:58:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:58:45,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:58:45,959 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:58:45,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:58:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:58:45,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:58:46,085 INFO L478 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 13 treesize of output 10 [2018-12-08 10:58:46,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-08 10:58:46,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:58:46,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:58:46,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:58:46,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-08 10:58:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 10:58:46,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:58:46,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 35 [2018-12-08 10:58:46,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-08 10:58:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-08 10:58:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1086, Unknown=0, NotChecked=0, Total=1190 [2018-12-08 10:58:46,240 INFO L87 Difference]: Start difference. First operand 428 states and 482 transitions. Second operand 35 states. [2018-12-08 10:59:29,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 10:59:29,857 INFO L93 Difference]: Finished difference Result 433 states and 472 transitions. [2018-12-08 10:59:29,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-08 10:59:29,857 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 91 [2018-12-08 10:59:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 10:59:29,858 INFO L225 Difference]: With dead ends: 433 [2018-12-08 10:59:29,858 INFO L226 Difference]: Without dead ends: 428 [2018-12-08 10:59:29,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=363, Invalid=2943, Unknown=0, NotChecked=0, Total=3306 [2018-12-08 10:59:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-12-08 10:59:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 408. [2018-12-08 10:59:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-12-08 10:59:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 456 transitions. [2018-12-08 10:59:29,862 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 456 transitions. Word has length 91 [2018-12-08 10:59:29,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 10:59:29,862 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 456 transitions. [2018-12-08 10:59:29,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-08 10:59:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 456 transitions. [2018-12-08 10:59:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 10:59:29,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 10:59:29,863 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 10:59:29,864 INFO L423 AbstractCegarLoop]: === Iteration 55 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 10:59:29,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 10:59:29,864 INFO L82 PathProgramCache]: Analyzing trace with hash 982356200, now seen corresponding path program 2 times [2018-12-08 10:59:29,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 10:59:29,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 10:59:29,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:59:29,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 10:59:29,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 10:59:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 10:59:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:59:32,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 10:59:32,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 10:59:32,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 10:59:32,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 10:59:32,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 10:59:32,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 10:59:32,263 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 10:59:32,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-08 10:59:32,313 INFO L478 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 11 treesize of output 8 [2018-12-08 10:59:32,314 INFO L478 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 8 treesize of output 7 [2018-12-08 10:59:32,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 10:59:32,362 INFO L478 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 23 treesize of output 18 [2018-12-08 10:59:32,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,364 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-08 10:59:32,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-12-08 10:59:32,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-12-08 10:59:32,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:38 [2018-12-08 10:59:32,478 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-08 10:59:32,479 INFO L478 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 8 treesize of output 7 [2018-12-08 10:59:32,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-12-08 10:59:32,545 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-12-08 10:59:32,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,547 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:59:32,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,561 INFO L267 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. [2018-12-08 10:59:32,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:45 [2018-12-08 10:59:32,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2018-12-08 10:59:32,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,637 INFO L267 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. [2018-12-08 10:59:32,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:69 [2018-12-08 10:59:32,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 93 [2018-12-08 10:59:32,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-08 10:59:32,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:32,904 INFO L267 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. [2018-12-08 10:59:32,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:175, output treesize:92 [2018-12-08 10:59:32,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 90 [2018-12-08 10:59:32,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:32,998 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 93 [2018-12-08 10:59:32,998 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 10:59:33,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 10:59:33,043 INFO L478 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 10 treesize of output 9 [2018-12-08 10:59:33,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:59:33,064 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:118, output treesize:152 [2018-12-08 10:59:33,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 176 [2018-12-08 10:59:33,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,260 INFO L267 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. [2018-12-08 10:59:33,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:163, output treesize:199 [2018-12-08 10:59:33,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 175 [2018-12-08 10:59:33,377 INFO L478 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 8 treesize of output 7 [2018-12-08 10:59:33,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 116 [2018-12-08 10:59:33,433 INFO L478 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 8 treesize of output 7 [2018-12-08 10:59:33,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,471 INFO L267 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. [2018-12-08 10:59:33,471 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:221, output treesize:213 [2018-12-08 10:59:33,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 188 [2018-12-08 10:59:33,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,605 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:59:33,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 129 [2018-12-08 10:59:33,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,669 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 10:59:33,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,711 INFO L267 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. [2018-12-08 10:59:33,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:251, output treesize:213 [2018-12-08 10:59:33,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:33,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 227 [2018-12-08 10:59:33,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:33,767 INFO L267 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. [2018-12-08 10:59:33,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:227, output treesize:267 [2018-12-08 10:59:34,022 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-12-08 10:59:34,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 151 [2018-12-08 10:59:34,036 INFO L478 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 8 treesize of output 7 [2018-12-08 10:59:34,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:34,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:34,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 240 [2018-12-08 10:59:34,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-12-08 10:59:34,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:34,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:34,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:59:34,204 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:292, output treesize:296 [2018-12-08 10:59:34,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 265 treesize of output 297 [2018-12-08 10:59:34,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,462 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 146 treesize of output 199 [2018-12-08 10:59:34,466 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2018-12-08 10:59:34,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:34,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 226 [2018-12-08 10:59:34,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:34,728 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-12-08 10:59:34,729 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:34,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 10:59:34,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 10:59:34,999 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:322, output treesize:602 [2018-12-08 10:59:36,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:36,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 581 treesize of output 487 [2018-12-08 10:59:36,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 10:59:36,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:36,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 152 [2018-12-08 10:59:36,808 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:36,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:36,838 INFO L478 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 0 case distinctions, treesize of input 375 treesize of output 307 [2018-12-08 10:59:36,839 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:59:36,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:59:36,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 10:59:36,913 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:644, output treesize:370 [2018-12-08 10:59:37,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:37,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:37,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:37,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:37,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:37,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:37,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 226 [2018-12-08 10:59:37,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 10:59:37,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:37,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 10:59:37,535 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:37,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 10:59:37,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2018-12-08 10:59:37,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 10:59:37,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 69 [2018-12-08 10:59:37,603 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:59:37,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2018-12-08 10:59:37,629 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 10:59:37,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 10:59:37,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-08 10:59:37,680 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:395, output treesize:91 [2018-12-08 10:59:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 30 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 10:59:37,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 10:59:37,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 31] total 66 [2018-12-08 10:59:37,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-08 10:59:37,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-08 10:59:37,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4162, Unknown=1, NotChecked=0, Total=4422 [2018-12-08 10:59:37,896 INFO L87 Difference]: Start difference. First operand 408 states and 456 transitions. Second operand 67 states. [2018-12-08 10:59:38,854 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2018-12-08 10:59:39,258 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 66 [2018-12-08 10:59:39,871 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 52 [2018-12-08 10:59:40,397 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 65 [2018-12-08 10:59:40,889 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 84 [2018-12-08 10:59:41,220 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 104 [2018-12-08 10:59:41,554 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 110 [2018-12-08 10:59:42,002 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 77 [2018-12-08 10:59:42,619 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 96 [2018-12-08 10:59:43,333 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 114 [2018-12-08 10:59:44,284 WARN L180 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 171 [2018-12-08 10:59:45,072 WARN L180 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 181 [2018-12-08 10:59:45,878 WARN L180 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 192 [2018-12-08 10:59:46,167 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2018-12-08 10:59:46,722 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 159 [2018-12-08 10:59:47,487 WARN L180 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 164 [2018-12-08 10:59:48,158 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 161 [2018-12-08 10:59:48,990 WARN L180 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 161 [2018-12-08 10:59:49,837 WARN L180 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 167 [2018-12-08 10:59:50,285 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 159 [2018-12-08 10:59:50,852 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 161 [2018-12-08 10:59:54,590 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 225 DAG size of output: 162 [2018-12-08 10:59:54,889 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 163 [2018-12-08 10:59:55,409 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 204 [2018-12-08 10:59:55,774 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 152 [2018-12-08 10:59:56,143 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 157 [2018-12-08 10:59:56,473 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 156 [2018-12-08 10:59:59,409 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 222 DAG size of output: 159 [2018-12-08 11:00:04,716 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 88 [2018-12-08 11:00:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:00:05,123 INFO L93 Difference]: Finished difference Result 426 states and 475 transitions. [2018-12-08 11:00:05,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-08 11:00:05,123 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 90 [2018-12-08 11:00:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:00:05,124 INFO L225 Difference]: With dead ends: 426 [2018-12-08 11:00:05,124 INFO L226 Difference]: Without dead ends: 426 [2018-12-08 11:00:05,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 61 SyntacticMatches, 12 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2276 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=914, Invalid=8787, Unknown=1, NotChecked=0, Total=9702 [2018-12-08 11:00:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-12-08 11:00:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 409. [2018-12-08 11:00:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-08 11:00:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 458 transitions. [2018-12-08 11:00:05,129 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 458 transitions. Word has length 90 [2018-12-08 11:00:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:00:05,129 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 458 transitions. [2018-12-08 11:00:05,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-08 11:00:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 458 transitions. [2018-12-08 11:00:05,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 11:00:05,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:00:05,130 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:00:05,130 INFO L423 AbstractCegarLoop]: === Iteration 56 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:00:05,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:00:05,130 INFO L82 PathProgramCache]: Analyzing trace with hash 982356201, now seen corresponding path program 2 times [2018-12-08 11:00:05,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:00:05,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:00:05,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:00:05,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:00:05,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:00:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:00:06,153 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2018-12-08 11:00:06,982 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2018-12-08 11:00:07,240 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2018-12-08 11:00:07,416 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2018-12-08 11:00:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:00:09,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:00:09,296 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:00:09,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:00:09,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 11:00:09,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:00:09,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:00:09,348 INFO L478 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 [2018-12-08 11:00:09,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 11:00:09,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:09,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:09,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 11:00:09,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,403 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 11:00:09,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 11:00:09,456 INFO L478 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 11 treesize of output 8 [2018-12-08 11:00:09,458 INFO L478 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 8 treesize of output 7 [2018-12-08 11:00:09,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,469 INFO L478 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 11 treesize of output 8 [2018-12-08 11:00:09,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 11:00:09,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,479 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-12-08 11:00:09,539 INFO L478 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 21 treesize of output 16 [2018-12-08 11:00:09,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:09,542 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 11:00:09,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,565 INFO L478 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 31 treesize of output 24 [2018-12-08 11:00:09,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:09,568 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-12-08 11:00:09,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,582 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:41 [2018-12-08 11:00:09,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:09,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2018-12-08 11:00:09,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:09,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:09,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 11:00:09,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:55 [2018-12-08 11:00:09,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-08 11:00:09,765 INFO L478 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 8 treesize of output 7 [2018-12-08 11:00:09,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 11:00:09,849 INFO L478 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 8 treesize of output 7 [2018-12-08 11:00:09,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:09,923 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-12-08 11:00:10,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-12-08 11:00:10,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:10,033 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:00:10,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-08 11:00:10,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:10,107 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:00:10,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,143 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:69 [2018-12-08 11:00:10,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:10,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:10,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:10,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-12-08 11:00:10,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 45 [2018-12-08 11:00:10,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:90 [2018-12-08 11:00:10,490 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2018-12-08 11:00:10,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 11:00:10,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,585 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-12-08 11:00:10,588 INFO L478 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 8 treesize of output 7 [2018-12-08 11:00:10,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,656 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:115, output treesize:125 [2018-12-08 11:00:10,918 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2018-12-08 11:00:10,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:10,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 80 [2018-12-08 11:00:10,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:10,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:11,063 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 70 [2018-12-08 11:00:11,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:11,072 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-12-08 11:00:11,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:11,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:11,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:11,161 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:203 [2018-12-08 11:00:11,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:11,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:11,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:11,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 132 [2018-12-08 11:00:11,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:11,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:11,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:11,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:11,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:11,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 91 [2018-12-08 11:00:11,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:11,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:11,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:220, output treesize:235 [2018-12-08 11:00:11,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 177 [2018-12-08 11:00:11,731 INFO L478 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 8 treesize of output 7 [2018-12-08 11:00:11,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:11,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:11,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 199 [2018-12-08 11:00:11,807 INFO L478 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 8 treesize of output 7 [2018-12-08 11:00:11,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:11,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:11,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:11,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:257, output treesize:249 [2018-12-08 11:00:12,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 212 [2018-12-08 11:00:12,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,013 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:00:12,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 190 [2018-12-08 11:00:12,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,099 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:00:12,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:287, output treesize:249 [2018-12-08 11:00:12,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 163 [2018-12-08 11:00:12,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 81 [2018-12-08 11:00:12,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:263, output treesize:253 [2018-12-08 11:00:12,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 221 [2018-12-08 11:00:12,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-08 11:00:12,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 214 [2018-12-08 11:00:12,496 INFO L478 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 8 treesize of output 7 [2018-12-08 11:00:12,496 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,564 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:278, output treesize:288 [2018-12-08 11:00:12,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 247 [2018-12-08 11:00:12,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,734 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-12-08 11:00:12,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 268 [2018-12-08 11:00:12,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:12,862 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 126 [2018-12-08 11:00:12,863 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:00:12,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:12,961 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:314, output treesize:600 [2018-12-08 11:00:14,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:14,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:14,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 657 treesize of output 471 [2018-12-08 11:00:14,851 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 350 treesize of output 308 [2018-12-08 11:00:14,855 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-12-08 11:00:14,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 278 treesize of output 233 [2018-12-08 11:00:14,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:14,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 290 treesize of output 245 [2018-12-08 11:00:14,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:14,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 288 treesize of output 243 [2018-12-08 11:00:14,979 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:15,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 218 [2018-12-08 11:00:15,103 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:15,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 228 [2018-12-08 11:00:15,105 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:15,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 230 [2018-12-08 11:00:15,109 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:15,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-08 11:00:15,238 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:15,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:15,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 306 treesize of output 220 [2018-12-08 11:00:15,344 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 11:00:15,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 184 [2018-12-08 11:00:15,347 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 11:00:15,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:15,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 304 treesize of output 218 [2018-12-08 11:00:15,358 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 11:00:15,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 20 dim-0 vars, and 5 xjuncts. [2018-12-08 11:00:15,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 166 [2018-12-08 11:00:15,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-08 11:00:15,776 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:15,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 3 [2018-12-08 11:00:15,812 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:15,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 11:00:15,840 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:15,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2018-12-08 11:00:15,864 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:15,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-08 11:00:15,885 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:15,904 INFO L267 ElimStorePlain]: Start of recursive call 14: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:15,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 150 [2018-12-08 11:00:15,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:15,916 INFO L478 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 0 case distinctions, treesize of input 81 treesize of output 57 [2018-12-08 11:00:15,916 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 11:00:15,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 11:00:15,957 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:15,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-12-08 11:00:15,984 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-08 11:00:16,010 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 11:00:16,032 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,052 INFO L267 ElimStorePlain]: Start of recursive call 20: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 150 [2018-12-08 11:00:16,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 11:00:16,062 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-08 11:00:16,092 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 39 [2018-12-08 11:00:16,119 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:00:16,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-12-08 11:00:16,145 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-08 11:00:16,169 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,189 INFO L267 ElimStorePlain]: Start of recursive call 26: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 166 [2018-12-08 11:00:16,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:00:16,200 INFO L478 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 0 case distinctions, treesize of input 60 treesize of output 36 [2018-12-08 11:00:16,201 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 11:00:16,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 11:00:16,237 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 11:00:16,266 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:00:16,292 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-08 11:00:16,316 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,341 INFO L267 ElimStorePlain]: Start of recursive call 32: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 154 [2018-12-08 11:00:16,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-08 11:00:16,353 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2018-12-08 11:00:16,383 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:00:16,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:00:16,412 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 11:00:16,440 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-08 11:00:16,464 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,484 INFO L267 ElimStorePlain]: Start of recursive call 38: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:00:16,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 25 dim-0 vars, and 5 xjuncts. [2018-12-08 11:00:16,605 INFO L202 ElimStorePlain]: Needed 43 recursive calls to eliminate 4 variables, input treesize:686, output treesize:391 [2018-12-08 11:00:17,081 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 48 [2018-12-08 11:00:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:00:17,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:00:17,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 25] total 63 [2018-12-08 11:00:17,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-08 11:00:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-08 11:00:17,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3853, Unknown=0, NotChecked=0, Total=4032 [2018-12-08 11:00:17,196 INFO L87 Difference]: Start difference. First operand 409 states and 458 transitions. Second operand 64 states. [2018-12-08 11:00:28,112 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 101 [2018-12-08 11:00:32,544 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 84 [2018-12-08 11:00:45,524 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 83 [2018-12-08 11:00:47,883 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 102 [2018-12-08 11:00:48,317 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 132 [2018-12-08 11:00:52,883 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 130 [2018-12-08 11:00:53,351 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 104 [2018-12-08 11:00:53,721 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 95 [2018-12-08 11:00:58,232 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 125 [2018-12-08 11:01:00,962 WARN L180 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 299 DAG size of output: 180 [2018-12-08 11:01:01,802 WARN L180 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 204 [2018-12-08 11:01:07,210 WARN L180 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 202 [2018-12-08 11:01:07,577 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2018-12-08 11:01:08,233 WARN L180 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 158 [2018-12-08 11:01:09,278 WARN L180 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 160 [2018-12-08 11:01:10,449 WARN L180 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 174 [2018-12-08 11:01:10,860 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 167 [2018-12-08 11:01:14,762 WARN L180 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 231 DAG size of output: 172 [2018-12-08 11:01:15,515 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 173 [2018-12-08 11:01:15,930 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 164 [2018-12-08 11:01:19,043 WARN L180 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 224 DAG size of output: 169 [2018-12-08 11:01:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:01:22,061 INFO L93 Difference]: Finished difference Result 425 states and 474 transitions. [2018-12-08 11:01:22,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-08 11:01:22,061 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 90 [2018-12-08 11:01:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:01:22,062 INFO L225 Difference]: With dead ends: 425 [2018-12-08 11:01:22,062 INFO L226 Difference]: Without dead ends: 425 [2018-12-08 11:01:22,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 67 SyntacticMatches, 11 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1454 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=737, Invalid=7095, Unknown=0, NotChecked=0, Total=7832 [2018-12-08 11:01:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-12-08 11:01:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 399. [2018-12-08 11:01:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-08 11:01:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 447 transitions. [2018-12-08 11:01:22,066 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 447 transitions. Word has length 90 [2018-12-08 11:01:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:01:22,066 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 447 transitions. [2018-12-08 11:01:22,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-08 11:01:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 447 transitions. [2018-12-08 11:01:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 11:01:22,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:01:22,067 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:01:22,067 INFO L423 AbstractCegarLoop]: === Iteration 57 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:01:22,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:01:22,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1219120502, now seen corresponding path program 2 times [2018-12-08 11:01:22,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:01:22,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:01:22,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:01:22,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:01:22,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:01:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:01:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:01:24,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:01:24,179 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:01:24,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 11:01:24,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 11:01:24,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:01:24,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:01:24,342 INFO L478 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 13 treesize of output 10 [2018-12-08 11:01:24,343 INFO L478 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 10 treesize of output 9 [2018-12-08 11:01:24,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,354 INFO L478 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 13 treesize of output 10 [2018-12-08 11:01:24,355 INFO L478 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 10 treesize of output 9 [2018-12-08 11:01:24,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,362 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-12-08 11:01:24,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:24,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:24,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 11:01:24,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:39 [2018-12-08 11:01:24,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 11:01:24,529 INFO L478 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 8 treesize of output 7 [2018-12-08 11:01:24,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 11:01:24,551 INFO L478 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 8 treesize of output 7 [2018-12-08 11:01:24,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-12-08 11:01:24,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-12-08 11:01:24,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:24,638 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:01:24,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-12-08 11:01:24,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:24,664 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:01:24,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2018-12-08 11:01:24,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:24,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:24,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:24,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-12-08 11:01:24,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:69 [2018-12-08 11:01:24,779 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-12-08 11:01:24,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 11:01:24,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,815 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2018-12-08 11:01:24,816 INFO L478 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 8 treesize of output 7 [2018-12-08 11:01:24,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:100 [2018-12-08 11:01:24,930 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-12-08 11:01:24,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:24,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 71 [2018-12-08 11:01:24,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,973 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-12-08 11:01:24,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:24,976 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-12-08 11:01:24,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:24,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:154 [2018-12-08 11:01:25,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:25,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:25,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:25,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:25,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 91 [2018-12-08 11:01:25,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:168, output treesize:184 [2018-12-08 11:01:25,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 161 [2018-12-08 11:01:25,307 INFO L478 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 8 treesize of output 7 [2018-12-08 11:01:25,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 153 [2018-12-08 11:01:25,370 INFO L478 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 8 treesize of output 7 [2018-12-08 11:01:25,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:209, output treesize:201 [2018-12-08 11:01:25,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 174 [2018-12-08 11:01:25,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:25,552 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:01:25,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 166 [2018-12-08 11:01:25,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:25,625 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:01:25,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:239, output treesize:201 [2018-12-08 11:01:25,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:25,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:25,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:25,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:25,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:25,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 81 [2018-12-08 11:01:25,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:209, output treesize:200 [2018-12-08 11:01:25,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 186 [2018-12-08 11:01:25,847 INFO L478 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 8 treesize of output 7 [2018-12-08 11:01:25,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:25,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 183 [2018-12-08 11:01:25,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-08 11:01:25,932 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:25,998 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:225, output treesize:239 [2018-12-08 11:01:26,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:26,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:26,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:26,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 223 [2018-12-08 11:01:26,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:26,170 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 117 [2018-12-08 11:01:26,171 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:01:26,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:26,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:26,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 269 [2018-12-08 11:01:26,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:01:26,287 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:01:26,287 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 67 [2018-12-08 11:01:26,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:01:26,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:26,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:01:26,365 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:265, output treesize:484 [2018-12-08 11:01:26,824 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-08 11:01:27,255 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-08 11:01:27,737 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-08 11:01:28,216 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-08 11:01:28,849 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-12-08 11:01:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:01:30,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:01:30,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 28] total 64 [2018-12-08 11:01:30,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-08 11:01:30,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-08 11:01:30,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3855, Unknown=4, NotChecked=0, Total=4032 [2018-12-08 11:01:30,479 INFO L87 Difference]: Start difference. First operand 399 states and 447 transitions. Second operand 64 states. [2018-12-08 11:01:43,041 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 97 [2018-12-08 11:01:43,378 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 105 [2018-12-08 11:01:43,783 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 75 [2018-12-08 11:01:52,333 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 83 [2018-12-08 11:02:00,981 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 113 [2018-12-08 11:02:01,553 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 164 [2018-12-08 11:02:02,151 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 171 [2018-12-08 11:02:03,459 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 150 [2018-12-08 11:02:04,353 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 91 [2018-12-08 11:02:05,111 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 153 [2018-12-08 11:02:05,435 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 84 [2018-12-08 11:02:06,216 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 153 [2018-12-08 11:02:06,801 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 158 [2018-12-08 11:02:07,350 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 151 [2018-12-08 11:02:07,990 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 174 [2018-12-08 11:02:08,450 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 163 [2018-12-08 11:02:08,978 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 162 [2018-12-08 11:02:09,757 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 165 [2018-12-08 11:02:10,188 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2018-12-08 11:02:11,269 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 174 [2018-12-08 11:02:11,916 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 165 [2018-12-08 11:02:12,305 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 162 [2018-12-08 11:02:12,986 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 178 [2018-12-08 11:02:13,548 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 157 [2018-12-08 11:02:14,853 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 164 [2018-12-08 11:02:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:02:18,287 INFO L93 Difference]: Finished difference Result 509 states and 563 transitions. [2018-12-08 11:02:18,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-08 11:02:18,288 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 90 [2018-12-08 11:02:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:02:18,288 INFO L225 Difference]: With dead ends: 509 [2018-12-08 11:02:18,289 INFO L226 Difference]: Without dead ends: 505 [2018-12-08 11:02:18,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 67 SyntacticMatches, 10 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3430 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=986, Invalid=14016, Unknown=4, NotChecked=0, Total=15006 [2018-12-08 11:02:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-12-08 11:02:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 463. [2018-12-08 11:02:18,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-12-08 11:02:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 512 transitions. [2018-12-08 11:02:18,294 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 512 transitions. Word has length 90 [2018-12-08 11:02:18,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:02:18,294 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 512 transitions. [2018-12-08 11:02:18,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-08 11:02:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 512 transitions. [2018-12-08 11:02:18,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 11:02:18,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:02:18,294 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:02:18,295 INFO L423 AbstractCegarLoop]: === Iteration 58 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:02:18,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:02:18,295 INFO L82 PathProgramCache]: Analyzing trace with hash -886534084, now seen corresponding path program 1 times [2018-12-08 11:02:18,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:02:18,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:02:18,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:18,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:02:18,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 11:02:18,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:02:18,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 11:02:18,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:02:18,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:02:18,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:02:18,316 INFO L87 Difference]: Start difference. First operand 463 states and 512 transitions. Second operand 3 states. [2018-12-08 11:02:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:02:18,321 INFO L93 Difference]: Finished difference Result 464 states and 513 transitions. [2018-12-08 11:02:18,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:02:18,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-12-08 11:02:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:02:18,323 INFO L225 Difference]: With dead ends: 464 [2018-12-08 11:02:18,323 INFO L226 Difference]: Without dead ends: 464 [2018-12-08 11:02:18,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:02:18,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-12-08 11:02:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2018-12-08 11:02:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-12-08 11:02:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 513 transitions. [2018-12-08 11:02:18,327 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 513 transitions. Word has length 93 [2018-12-08 11:02:18,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:02:18,327 INFO L480 AbstractCegarLoop]: Abstraction has 464 states and 513 transitions. [2018-12-08 11:02:18,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:02:18,327 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 513 transitions. [2018-12-08 11:02:18,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 11:02:18,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:02:18,327 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:02:18,328 INFO L423 AbstractCegarLoop]: === Iteration 59 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:02:18,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:02:18,328 INFO L82 PathProgramCache]: Analyzing trace with hash -796835825, now seen corresponding path program 1 times [2018-12-08 11:02:18,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:02:18,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:02:18,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:18,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:18,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 11:02:18,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:02:18,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:02:18,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 11:02:18,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 11:02:18,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:02:18,355 INFO L87 Difference]: Start difference. First operand 464 states and 513 transitions. Second operand 5 states. [2018-12-08 11:02:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:02:18,491 INFO L93 Difference]: Finished difference Result 488 states and 536 transitions. [2018-12-08 11:02:18,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 11:02:18,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-08 11:02:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:02:18,493 INFO L225 Difference]: With dead ends: 488 [2018-12-08 11:02:18,493 INFO L226 Difference]: Without dead ends: 488 [2018-12-08 11:02:18,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:02:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-12-08 11:02:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 476. [2018-12-08 11:02:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-12-08 11:02:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 536 transitions. [2018-12-08 11:02:18,499 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 536 transitions. Word has length 95 [2018-12-08 11:02:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:02:18,500 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 536 transitions. [2018-12-08 11:02:18,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 11:02:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 536 transitions. [2018-12-08 11:02:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 11:02:18,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:02:18,500 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:02:18,501 INFO L423 AbstractCegarLoop]: === Iteration 60 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:02:18,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:02:18,501 INFO L82 PathProgramCache]: Analyzing trace with hash -796835824, now seen corresponding path program 1 times [2018-12-08 11:02:18,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:02:18,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:02:18,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:18,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:18,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 11:02:18,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:02:18,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:02:18,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:02:18,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:02:18,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:02:18,542 INFO L87 Difference]: Start difference. First operand 476 states and 536 transitions. Second operand 6 states. [2018-12-08 11:02:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:02:18,667 INFO L93 Difference]: Finished difference Result 486 states and 534 transitions. [2018-12-08 11:02:18,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 11:02:18,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-08 11:02:18,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:02:18,668 INFO L225 Difference]: With dead ends: 486 [2018-12-08 11:02:18,668 INFO L226 Difference]: Without dead ends: 486 [2018-12-08 11:02:18,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:02:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-12-08 11:02:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 476. [2018-12-08 11:02:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-12-08 11:02:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 534 transitions. [2018-12-08 11:02:18,672 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 534 transitions. Word has length 95 [2018-12-08 11:02:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:02:18,672 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 534 transitions. [2018-12-08 11:02:18,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:02:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 534 transitions. [2018-12-08 11:02:18,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 11:02:18,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:02:18,672 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:02:18,673 INFO L423 AbstractCegarLoop]: === Iteration 61 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:02:18,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:02:18,673 INFO L82 PathProgramCache]: Analyzing trace with hash -796744530, now seen corresponding path program 1 times [2018-12-08 11:02:18,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:02:18,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:02:18,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:18,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:18,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 11:02:18,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:02:18,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 11:02:18,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:02:18,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:02:18,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:02:18,690 INFO L87 Difference]: Start difference. First operand 476 states and 534 transitions. Second operand 3 states. [2018-12-08 11:02:18,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:02:18,695 INFO L93 Difference]: Finished difference Result 477 states and 535 transitions. [2018-12-08 11:02:18,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:02:18,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-12-08 11:02:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:02:18,696 INFO L225 Difference]: With dead ends: 477 [2018-12-08 11:02:18,696 INFO L226 Difference]: Without dead ends: 477 [2018-12-08 11:02:18,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:02:18,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-12-08 11:02:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2018-12-08 11:02:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-08 11:02:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 535 transitions. [2018-12-08 11:02:18,700 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 535 transitions. Word has length 95 [2018-12-08 11:02:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:02:18,700 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 535 transitions. [2018-12-08 11:02:18,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:02:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 535 transitions. [2018-12-08 11:02:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 11:02:18,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:02:18,701 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:02:18,701 INFO L423 AbstractCegarLoop]: === Iteration 62 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:02:18,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:02:18,701 INFO L82 PathProgramCache]: Analyzing trace with hash -675201215, now seen corresponding path program 1 times [2018-12-08 11:02:18,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:02:18,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:02:18,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:18,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:18,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 11:02:18,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:02:18,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:02:18,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:18,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:02:18,866 INFO L478 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 13 treesize of output 10 [2018-12-08 11:02:18,867 INFO L478 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 10 treesize of output 9 [2018-12-08 11:02:18,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:18,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:18,880 INFO L478 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 13 treesize of output 10 [2018-12-08 11:02:18,881 INFO L478 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 10 treesize of output 9 [2018-12-08 11:02:18,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:18,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:18,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:18,887 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-12-08 11:02:19,222 INFO L478 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 65 treesize of output 62 [2018-12-08 11:02:19,227 INFO L478 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 1 case distinctions, treesize of input 47 treesize of output 40 [2018-12-08 11:02:19,228 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:02:19,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 55 treesize of output 36 [2018-12-08 11:02:19,249 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 28 [2018-12-08 11:02:19,268 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:19,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 11:02:19,313 INFO L478 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 28 treesize of output 24 [2018-12-08 11:02:19,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-08 11:02:19,314 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,321 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2018-12-08 11:02:19,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 34 treesize of output 25 [2018-12-08 11:02:19,328 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 21 [2018-12-08 11:02:19,343 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,355 INFO L478 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 0 case distinctions, treesize of input 30 treesize of output 20 [2018-12-08 11:02:19,356 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,362 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2018-12-08 11:02:19,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-12-08 11:02:19,368 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:19,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-12-08 11:02:19,381 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,394 INFO L478 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 20 treesize of output 24 [2018-12-08 11:02:19,395 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,401 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 57 [2018-12-08 11:02:19,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2018-12-08 11:02:19,422 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:19,442 INFO L478 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 43 treesize of output 37 [2018-12-08 11:02:19,442 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:02:19,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 41 treesize of output 34 [2018-12-08 11:02:19,464 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,482 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 11:02:19,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2018-12-08 11:02:19,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 30 treesize of output 25 [2018-12-08 11:02:19,510 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 22 treesize of output 17 [2018-12-08 11:02:19,525 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,537 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-12-08 11:02:19,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 11:02:19,540 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2018-12-08 11:02:19,545 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,548 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,553 INFO L478 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 24 treesize of output 31 [2018-12-08 11:02:19,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 20 [2018-12-08 11:02:19,554 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 11 [2018-12-08 11:02:19,565 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,574 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:02:19,582 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 8 variables, input treesize:131, output treesize:9 [2018-12-08 11:02:19,607 INFO L478 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 11 treesize of output 8 [2018-12-08 11:02:19,609 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:19,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,614 INFO L478 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 11 treesize of output 8 [2018-12-08 11:02:19,615 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:19,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,622 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-12-08 11:02:19,650 INFO L478 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 11 [2018-12-08 11:02:19,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:02:19,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,656 INFO L478 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 11 [2018-12-08 11:02:19,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:02:19,657 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:19,667 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-08 11:02:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 11:02:19,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:02:19,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 34 [2018-12-08 11:02:19,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-08 11:02:19,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-08 11:02:19,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1050, Unknown=0, NotChecked=0, Total=1122 [2018-12-08 11:02:19,788 INFO L87 Difference]: Start difference. First operand 477 states and 535 transitions. Second operand 34 states. [2018-12-08 11:02:22,488 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2018-12-08 11:02:22,835 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2018-12-08 11:02:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:02:28,565 INFO L93 Difference]: Finished difference Result 602 states and 686 transitions. [2018-12-08 11:02:28,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-08 11:02:28,566 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 95 [2018-12-08 11:02:28,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:02:28,570 INFO L225 Difference]: With dead ends: 602 [2018-12-08 11:02:28,570 INFO L226 Difference]: Without dead ends: 602 [2018-12-08 11:02:28,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=324, Invalid=3458, Unknown=0, NotChecked=0, Total=3782 [2018-12-08 11:02:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-12-08 11:02:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 507. [2018-12-08 11:02:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-12-08 11:02:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 579 transitions. [2018-12-08 11:02:28,587 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 579 transitions. Word has length 95 [2018-12-08 11:02:28,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:02:28,587 INFO L480 AbstractCegarLoop]: Abstraction has 507 states and 579 transitions. [2018-12-08 11:02:28,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-08 11:02:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 579 transitions. [2018-12-08 11:02:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 11:02:28,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:02:28,589 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:02:28,590 INFO L423 AbstractCegarLoop]: === Iteration 63 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:02:28,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:02:28,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1255040720, now seen corresponding path program 1 times [2018-12-08 11:02:28,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:02:28,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:02:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:28,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 11:02:28,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:02:28,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:02:28,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:28,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:02:28,905 INFO L478 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 13 treesize of output 10 [2018-12-08 11:02:28,907 INFO L478 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 10 treesize of output 9 [2018-12-08 11:02:28,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:28,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:28,915 INFO L478 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 13 treesize of output 10 [2018-12-08 11:02:28,916 INFO L478 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 10 treesize of output 9 [2018-12-08 11:02:28,916 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:28,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:28,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:28,922 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-12-08 11:02:29,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 65 [2018-12-08 11:02:29,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2018-12-08 11:02:29,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:29,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-12-08 11:02:29,844 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:29,861 INFO L478 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 51 treesize of output 47 [2018-12-08 11:02:29,862 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:02:29,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 11:02:29,914 INFO L478 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 65 treesize of output 68 [2018-12-08 11:02:29,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2018-12-08 11:02:29,916 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:29,937 INFO L478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2018-12-08 11:02:29,937 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:02:29,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 50 treesize of output 38 [2018-12-08 11:02:29,955 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:29,972 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 11:02:30,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-12-08 11:02:30,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 30 treesize of output 15 [2018-12-08 11:02:30,018 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,040 INFO L478 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 26 treesize of output 24 [2018-12-08 11:02:30,041 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,047 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,048 INFO L478 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 38 treesize of output 30 [2018-12-08 11:02:30,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-12-08 11:02:30,050 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:30,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-12-08 11:02:30,056 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,059 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2018-12-08 11:02:30,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 28 [2018-12-08 11:02:30,066 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:30,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2018-12-08 11:02:30,087 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,095 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-12-08 11:02:30,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 4 [2018-12-08 11:02:30,125 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-12-08 11:02:30,129 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,132 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,136 INFO L478 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 34 treesize of output 33 [2018-12-08 11:02:30,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 26 treesize of output 19 [2018-12-08 11:02:30,138 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 15 [2018-12-08 11:02:30,149 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,158 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,163 INFO L478 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 40 treesize of output 39 [2018-12-08 11:02:30,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 32 treesize of output 25 [2018-12-08 11:02:30,165 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 24 treesize of output 17 [2018-12-08 11:02:30,178 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,190 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:02:30,199 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 8 variables, input treesize:131, output treesize:9 [2018-12-08 11:02:30,255 INFO L478 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 27 treesize of output 24 [2018-12-08 11:02:30,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 11:02:30,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,277 INFO L478 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 23 treesize of output 20 [2018-12-08 11:02:30,278 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:30,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,293 INFO L478 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 27 treesize of output 24 [2018-12-08 11:02:30,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 11:02:30,295 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,298 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,309 INFO L478 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 23 treesize of output 20 [2018-12-08 11:02:30,310 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:30,310 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,313 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:02:30,321 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:55, output treesize:17 [2018-12-08 11:02:30,352 INFO L478 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 21 [2018-12-08 11:02:30,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 11:02:30,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,363 INFO L478 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 16 treesize of output 12 [2018-12-08 11:02:30,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-12-08 11:02:30,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,374 INFO L478 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 21 [2018-12-08 11:02:30,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 11:02:30,375 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,383 INFO L478 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 16 treesize of output 12 [2018-12-08 11:02:30,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-12-08 11:02:30,384 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,385 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:30,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:02:30,387 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:47, output treesize:9 [2018-12-08 11:02:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 11:02:30,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:02:30,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2018-12-08 11:02:30,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-08 11:02:30,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-08 11:02:30,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1470, Unknown=0, NotChecked=0, Total=1560 [2018-12-08 11:02:30,471 INFO L87 Difference]: Start difference. First operand 507 states and 579 transitions. Second operand 40 states. [2018-12-08 11:02:33,914 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-12-08 11:02:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:02:37,013 INFO L93 Difference]: Finished difference Result 761 states and 900 transitions. [2018-12-08 11:02:37,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-08 11:02:37,013 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 97 [2018-12-08 11:02:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:02:37,015 INFO L225 Difference]: With dead ends: 761 [2018-12-08 11:02:37,015 INFO L226 Difference]: Without dead ends: 755 [2018-12-08 11:02:37,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=371, Invalid=4741, Unknown=0, NotChecked=0, Total=5112 [2018-12-08 11:02:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-12-08 11:02:37,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 670. [2018-12-08 11:02:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-12-08 11:02:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 791 transitions. [2018-12-08 11:02:37,023 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 791 transitions. Word has length 97 [2018-12-08 11:02:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:02:37,023 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 791 transitions. [2018-12-08 11:02:37,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-08 11:02:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 791 transitions. [2018-12-08 11:02:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 11:02:37,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:02:37,024 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:02:37,024 INFO L423 AbstractCegarLoop]: === Iteration 64 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:02:37,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:02:37,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1094071806, now seen corresponding path program 1 times [2018-12-08 11:02:37,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:02:37,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:02:37,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:37,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:37,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 11:02:37,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:02:37,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:02:37,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:37,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:02:37,249 INFO L478 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 11 treesize of output 8 [2018-12-08 11:02:37,250 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:37,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-12-08 11:02:37,266 INFO L478 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 13 treesize of output 10 [2018-12-08 11:02:37,267 INFO L478 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 10 treesize of output 9 [2018-12-08 11:02:37,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2018-12-08 11:02:37,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-08 11:02:37,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 11:02:37,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:5 [2018-12-08 11:02:37,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:37,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:37,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 11:02:37,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,355 INFO L267 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. [2018-12-08 11:02:37,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-08 11:02:37,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-08 11:02:37,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,378 INFO L267 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. [2018-12-08 11:02:37,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-12-08 11:02:37,399 INFO L478 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 11 treesize of output 8 [2018-12-08 11:02:37,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 11:02:37,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:37,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:28 [2018-12-08 11:02:37,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:37,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:37,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:37,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:37,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2018-12-08 11:02:37,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,444 INFO L267 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. [2018-12-08 11:02:37,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:49 [2018-12-08 11:02:37,478 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-12-08 11:02:37,480 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:37,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,495 INFO L267 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. [2018-12-08 11:02:37,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:49 [2018-12-08 11:02:37,527 INFO L478 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 33 treesize of output 25 [2018-12-08 11:02:37,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 14 [2018-12-08 11:02:37,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:37,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:37,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:37 [2018-12-08 11:02:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 11:02:37,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:02:37,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2018-12-08 11:02:37,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-08 11:02:37,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-08 11:02:37,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2018-12-08 11:02:37,592 INFO L87 Difference]: Start difference. First operand 670 states and 791 transitions. Second operand 30 states. [2018-12-08 11:02:38,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:02:38,951 INFO L93 Difference]: Finished difference Result 723 states and 856 transitions. [2018-12-08 11:02:38,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 11:02:38,951 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 96 [2018-12-08 11:02:38,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:02:38,953 INFO L225 Difference]: With dead ends: 723 [2018-12-08 11:02:38,953 INFO L226 Difference]: Without dead ends: 723 [2018-12-08 11:02:38,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=1310, Unknown=0, NotChecked=0, Total=1482 [2018-12-08 11:02:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-12-08 11:02:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 670. [2018-12-08 11:02:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-12-08 11:02:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 788 transitions. [2018-12-08 11:02:38,959 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 788 transitions. Word has length 96 [2018-12-08 11:02:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:02:38,960 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 788 transitions. [2018-12-08 11:02:38,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-08 11:02:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 788 transitions. [2018-12-08 11:02:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-08 11:02:38,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:02:38,960 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:02:38,960 INFO L423 AbstractCegarLoop]: === Iteration 65 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:02:38,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:02:38,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1094071807, now seen corresponding path program 1 times [2018-12-08 11:02:38,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:02:38,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:02:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:38,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 11:02:39,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:02:39,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:02:39,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:39,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:02:39,273 INFO L478 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 [2018-12-08 11:02:39,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 11:02:39,300 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 11:02:39,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-12-08 11:02:39,322 INFO L478 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 11 treesize of output 8 [2018-12-08 11:02:39,324 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:39,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,335 INFO L478 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 11 treesize of output 8 [2018-12-08 11:02:39,336 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:39,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-12-08 11:02:39,365 INFO L478 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 21 treesize of output 16 [2018-12-08 11:02:39,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:39,368 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 11:02:39,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,384 INFO L478 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 23 treesize of output 18 [2018-12-08 11:02:39,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:39,387 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-08 11:02:39,387 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:28 [2018-12-08 11:02:39,713 INFO L478 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 26 treesize of output 20 [2018-12-08 11:02:39,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-08 11:02:39,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,747 INFO L478 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 11 [2018-12-08 11:02:39,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:02:39,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,769 INFO L267 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. [2018-12-08 11:02:39,769 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:19 [2018-12-08 11:02:39,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:39,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:39,860 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 11:02:39,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:39,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:39,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 11:02:39,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,889 INFO L267 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. [2018-12-08 11:02:39,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-12-08 11:02:39,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:39,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:39,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:39,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:39,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-12-08 11:02:39,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:39,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:39,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 36 [2018-12-08 11:02:39,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,947 INFO L267 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. [2018-12-08 11:02:39,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:38 [2018-12-08 11:02:39,992 INFO L478 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 11 treesize of output 8 [2018-12-08 11:02:39,993 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:39,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:39,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,010 INFO L478 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 11 treesize of output 8 [2018-12-08 11:02:40,012 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:40,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,024 INFO L267 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. [2018-12-08 11:02:40,024 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:50 [2018-12-08 11:02:40,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:40,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:40,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:40,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:40,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:40,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:40,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2018-12-08 11:02:40,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:40,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:40,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:40,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 73 [2018-12-08 11:02:40,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,096 INFO L267 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. [2018-12-08 11:02:40,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:44 [2018-12-08 11:02:40,141 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 11:02:40,142 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:40,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,165 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 11:02:40,166 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:40,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:40,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:66, output treesize:44 [2018-12-08 11:02:40,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 13 [2018-12-08 11:02:40,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 11:02:40,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-12-08 11:02:40,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:02:40,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:40,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:40,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:58, output treesize:36 [2018-12-08 11:02:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 11:02:40,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:02:40,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2018-12-08 11:02:40,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-08 11:02:40,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-08 11:02:40,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1222, Unknown=0, NotChecked=0, Total=1332 [2018-12-08 11:02:40,326 INFO L87 Difference]: Start difference. First operand 670 states and 788 transitions. Second operand 37 states. [2018-12-08 11:02:42,666 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-08 11:02:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:02:44,130 INFO L93 Difference]: Finished difference Result 709 states and 835 transitions. [2018-12-08 11:02:44,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 11:02:44,131 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 96 [2018-12-08 11:02:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:02:44,133 INFO L225 Difference]: With dead ends: 709 [2018-12-08 11:02:44,133 INFO L226 Difference]: Without dead ends: 709 [2018-12-08 11:02:44,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=230, Invalid=2122, Unknown=0, NotChecked=0, Total=2352 [2018-12-08 11:02:44,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-12-08 11:02:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 670. [2018-12-08 11:02:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-12-08 11:02:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 785 transitions. [2018-12-08 11:02:44,144 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 785 transitions. Word has length 96 [2018-12-08 11:02:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:02:44,144 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 785 transitions. [2018-12-08 11:02:44,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-08 11:02:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 785 transitions. [2018-12-08 11:02:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 11:02:44,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:02:44,145 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:02:44,146 INFO L423 AbstractCegarLoop]: === Iteration 66 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:02:44,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:02:44,146 INFO L82 PathProgramCache]: Analyzing trace with hash -568291499, now seen corresponding path program 1 times [2018-12-08 11:02:44,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:02:44,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:02:44,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:44,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:44,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 11:02:44,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:02:44,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:02:44,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:02:44,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:02:44,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:02:44,198 INFO L87 Difference]: Start difference. First operand 670 states and 785 transitions. Second operand 7 states. [2018-12-08 11:02:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:02:44,319 INFO L93 Difference]: Finished difference Result 739 states and 880 transitions. [2018-12-08 11:02:44,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 11:02:44,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-08 11:02:44,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:02:44,321 INFO L225 Difference]: With dead ends: 739 [2018-12-08 11:02:44,321 INFO L226 Difference]: Without dead ends: 739 [2018-12-08 11:02:44,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-08 11:02:44,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-12-08 11:02:44,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 695. [2018-12-08 11:02:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-12-08 11:02:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 812 transitions. [2018-12-08 11:02:44,330 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 812 transitions. Word has length 99 [2018-12-08 11:02:44,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:02:44,330 INFO L480 AbstractCegarLoop]: Abstraction has 695 states and 812 transitions. [2018-12-08 11:02:44,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:02:44,330 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 812 transitions. [2018-12-08 11:02:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 11:02:44,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:02:44,331 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:02:44,331 INFO L423 AbstractCegarLoop]: === Iteration 67 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:02:44,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:02:44,332 INFO L82 PathProgramCache]: Analyzing trace with hash -863970815, now seen corresponding path program 1 times [2018-12-08 11:02:44,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:02:44,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:02:44,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:44,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:44,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:02:44,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:02:44,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:02:44,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:44,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:02:44,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-12-08 11:02:44,948 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:44,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:44,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:44,954 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 11:02:44,954 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:44,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:44,960 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:16 [2018-12-08 11:02:44,983 INFO L478 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 13 treesize of output 10 [2018-12-08 11:02:44,984 INFO L478 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 10 treesize of output 9 [2018-12-08 11:02:44,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:44,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:44,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:44,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-12-08 11:02:45,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:45,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:45,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 11:02:45,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-12-08 11:02:45,040 INFO L478 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 11 treesize of output 8 [2018-12-08 11:02:45,041 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:45,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-08 11:02:45,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-08 11:02:45,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:45,078 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:02:45,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,086 INFO L267 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. [2018-12-08 11:02:45,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:22 [2018-12-08 11:02:45,162 INFO L478 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 3 case distinctions, treesize of input 19 treesize of output 31 [2018-12-08 11:02:45,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 19 [2018-12-08 11:02:45,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,182 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-12-08 11:02:45,182 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 11:02:45,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:02:45,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:02:45,204 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:39, output treesize:65 [2018-12-08 11:02:45,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 73 [2018-12-08 11:02:45,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:45,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2018-12-08 11:02:45,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:45,463 INFO L478 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 73 [2018-12-08 11:02:45,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 11:02:45,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 11:02:45,749 INFO L478 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 58 treesize of output 55 [2018-12-08 11:02:45,754 INFO L478 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 10 treesize of output 9 [2018-12-08 11:02:45,755 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,805 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,815 INFO L478 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 54 treesize of output 51 [2018-12-08 11:02:45,820 INFO L478 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 10 treesize of output 9 [2018-12-08 11:02:45,821 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,871 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,878 INFO L478 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 59 treesize of output 56 [2018-12-08 11:02:45,883 INFO L478 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 10 treesize of output 9 [2018-12-08 11:02:45,884 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,917 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-12-08 11:02:45,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:45,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 11:02:45,967 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:45,977 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:46,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:02:46,005 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:117, output treesize:113 [2018-12-08 11:02:47,342 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 38 [2018-12-08 11:02:47,618 INFO L478 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 102 treesize of output 92 [2018-12-08 11:02:47,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 37 [2018-12-08 11:02:47,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:47,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:47,669 INFO L478 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 120 treesize of output 110 [2018-12-08 11:02:47,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 37 [2018-12-08 11:02:47,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:47,683 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:47,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 11:02:47,708 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:223, output treesize:157 [2018-12-08 11:02:48,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:48,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:48,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 87 [2018-12-08 11:02:48,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:48,054 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 73 treesize of output 85 [2018-12-08 11:02:48,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-08 11:02:48,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2018-12-08 11:02:48,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-08 11:02:48,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:48,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:48,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 64 [2018-12-08 11:02:48,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:48,161 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 24 treesize of output 36 [2018-12-08 11:02:48,162 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-08 11:02:48,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-08 11:02:48,177 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,182 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,192 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:165, output treesize:5 [2018-12-08 11:02:48,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:48,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:48,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 11:02:48,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,233 INFO L267 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. [2018-12-08 11:02:48,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-08 11:02:48,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-08 11:02:48,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,281 INFO L267 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. [2018-12-08 11:02:48,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-12-08 11:02:48,330 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-08 11:02:48,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,334 INFO L267 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. [2018-12-08 11:02:48,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-12-08 11:02:48,384 INFO L478 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 11 treesize of output 8 [2018-12-08 11:02:48,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 11:02:48,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:48,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:33 [2018-12-08 11:02:48,509 INFO L478 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 19 [2018-12-08 11:02:48,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-12-08 11:02:48,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:48,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 11:02:48,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:20 [2018-12-08 11:02:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:02:48,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:02:48,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 36] total 61 [2018-12-08 11:02:48,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-08 11:02:48,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-08 11:02:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=3562, Unknown=0, NotChecked=0, Total=3782 [2018-12-08 11:02:48,650 INFO L87 Difference]: Start difference. First operand 695 states and 812 transitions. Second operand 62 states. [2018-12-08 11:02:50,046 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-12-08 11:02:51,083 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-12-08 11:02:51,408 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-12-08 11:02:51,616 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-12-08 11:02:51,765 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2018-12-08 11:02:52,104 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-12-08 11:02:52,636 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 102 [2018-12-08 11:02:52,995 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 102 [2018-12-08 11:02:53,406 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 105 [2018-12-08 11:02:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:02:56,087 INFO L93 Difference]: Finished difference Result 759 states and 894 transitions. [2018-12-08 11:02:56,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-08 11:02:56,087 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 98 [2018-12-08 11:02:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:02:56,089 INFO L225 Difference]: With dead ends: 759 [2018-12-08 11:02:56,089 INFO L226 Difference]: Without dead ends: 759 [2018-12-08 11:02:56,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2383 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=661, Invalid=7711, Unknown=0, NotChecked=0, Total=8372 [2018-12-08 11:02:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-12-08 11:02:56,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 702. [2018-12-08 11:02:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-12-08 11:02:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 820 transitions. [2018-12-08 11:02:56,100 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 820 transitions. Word has length 98 [2018-12-08 11:02:56,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:02:56,101 INFO L480 AbstractCegarLoop]: Abstraction has 702 states and 820 transitions. [2018-12-08 11:02:56,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-08 11:02:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 820 transitions. [2018-12-08 11:02:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 11:02:56,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:02:56,102 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:02:56,103 INFO L423 AbstractCegarLoop]: === Iteration 68 === [merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION]=== [2018-12-08 11:02:56,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:02:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash -863970814, now seen corresponding path program 1 times [2018-12-08 11:02:56,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 11:02:56,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 11:02:56,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:56,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:56,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 11:02:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:57,445 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2018-12-08 11:02:57,692 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2018-12-08 11:02:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:02:58,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 11:02:58,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 11:02:58,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:02:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:02:58,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:02:58,983 INFO L478 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 [2018-12-08 11:02:58,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:58,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:58,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 11:02:59,022 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 11:02:59,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-12-08 11:02:59,106 INFO L478 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 48 treesize of output 45 [2018-12-08 11:02:59,107 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:59,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,125 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 11:02:59,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,139 INFO L478 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 11 treesize of output 8 [2018-12-08 11:02:59,140 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:59,140 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,143 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,152 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:97, output treesize:37 [2018-12-08 11:02:59,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-08 11:02:59,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:59,207 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 11:02:59,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-08 11:02:59,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:59,228 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-12-08 11:02:59,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:37 [2018-12-08 11:02:59,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:59,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-12-08 11:02:59,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:59,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:59,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 11:02:59,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:44 [2018-12-08 11:02:59,377 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 11:02:59,379 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:59,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,401 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 11:02:59,402 INFO L478 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 8 treesize of output 7 [2018-12-08 11:02:59,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,420 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-12-08 11:02:59,493 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-08 11:02:59,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:59,497 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:02:59,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,522 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-12-08 11:02:59,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:02:59,525 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:02:59,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,543 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:61 [2018-12-08 11:02:59,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-12-08 11:02:59,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:69 [2018-12-08 11:02:59,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 59 [2018-12-08 11:02:59,667 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 11:02:59,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,727 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:02:59,729 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-12-08 11:02:59,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 24 [2018-12-08 11:02:59,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:02:59,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 57 [2018-12-08 11:02:59,856 INFO L478 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 35 treesize of output 34 [2018-12-08 11:02:59,857 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,926 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:02:59,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:02:59,958 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:94, output treesize:184 [2018-12-08 11:03:00,311 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-12-08 11:03:00,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 152 [2018-12-08 11:03:00,348 WARN L288 Elim1Store]: Array PQE input equivalent to false [2018-12-08 11:03:00,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:00,646 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:03:00,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:00,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 122 [2018-12-08 11:03:00,647 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:00,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:00,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 132 [2018-12-08 11:03:00,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:00,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:00,951 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 91 [2018-12-08 11:03:00,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:00,954 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:03:00,955 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 37 [2018-12-08 11:03:00,955 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:00,980 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:01,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 171 [2018-12-08 11:03:01,070 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 11:03:01,071 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:01,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:01,198 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:03:01,199 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 141 [2018-12-08 11:03:01,199 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:01,280 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:01,334 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 82 [2018-12-08 11:03:01,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:01,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 11:03:01,337 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:01,354 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:01,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:03:01,400 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:225, output treesize:269 [2018-12-08 11:03:02,056 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-08 11:03:04,535 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 60 [2018-12-08 11:03:05,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:05,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:05,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 160 [2018-12-08 11:03:05,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:05,703 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 74 [2018-12-08 11:03:05,704 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-08 11:03:05,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 44 [2018-12-08 11:03:05,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:03:05,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:03:05,799 INFO L478 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 86 treesize of output 70 [2018-12-08 11:03:05,801 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-08 11:03:05,801 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:05,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:05,815 INFO L478 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 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-08 11:03:05,815 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:05,825 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:05,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:05,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:05,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 213 [2018-12-08 11:03:05,882 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 193 [2018-12-08 11:03:05,885 INFO L267 ElimStorePlain]: Start of recursive call 9: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-12-08 11:03:06,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:06,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:06,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 175 [2018-12-08 11:03:06,073 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-08 11:03:06,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:06,078 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 141 [2018-12-08 11:03:06,078 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:06,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:06,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:06,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 175 [2018-12-08 11:03:06,092 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-08 11:03:06,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 118 [2018-12-08 11:03:06,348 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:06,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 137 treesize of output 128 [2018-12-08 11:03:06,351 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:06,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 124 [2018-12-08 11:03:06,353 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:06,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 114 [2018-12-08 11:03:06,356 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:06,513 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:03:06,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 163 [2018-12-08 11:03:06,514 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:03:06,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:06,668 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 115 [2018-12-08 11:03:06,668 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:06,816 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-12-08 11:03:06,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 87 [2018-12-08 11:03:06,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 64 [2018-12-08 11:03:06,961 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,005 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-12-08 11:03:07,005 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,052 INFO L267 ElimStorePlain]: Start of recursive call 19: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 98 [2018-12-08 11:03:07,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-12-08 11:03:07,057 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 11:03:07,076 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,095 INFO L478 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 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 11:03:07,095 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,111 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 114 treesize of output 98 [2018-12-08 11:03:07,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-12-08 11:03:07,117 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 11:03:07,137 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,154 INFO L478 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 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 11:03:07,155 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,167 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 114 treesize of output 94 [2018-12-08 11:03:07,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 11:03:07,172 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,191 INFO L478 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 0 case distinctions, treesize of input 40 treesize of output 26 [2018-12-08 11:03:07,191 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:03:07,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:03:07,210 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,224 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 114 treesize of output 98 [2018-12-08 11:03:07,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-12-08 11:03:07,230 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,251 INFO L478 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 0 case distinctions, treesize of input 29 treesize of output 21 [2018-12-08 11:03:07,252 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:03:07,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 11:03:07,269 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,284 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 16 dim-0 vars, and 6 xjuncts. [2018-12-08 11:03:07,363 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 8 variables, input treesize:419, output treesize:254 [2018-12-08 11:03:07,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 43 [2018-12-08 11:03:07,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-12-08 11:03:07,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 11:03:07,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-12-08 11:03:07,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:109 [2018-12-08 11:03:07,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 36 [2018-12-08 11:03:07,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:07,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-12-08 11:03:07,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:07,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 11:03:07,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:38 [2018-12-08 11:03:08,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:08,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:08,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:08,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:08,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:08,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:08,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 53 [2018-12-08 11:03:08,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:08,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:08,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:08,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:08,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:08,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:08,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:08,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 11:03:08,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:08,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 11:03:08,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:36 [2018-12-08 11:03:08,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 11:03:08,308 INFO L478 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 8 treesize of output 7 [2018-12-08 11:03:08,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:08,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:08,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 11:03:08,323 INFO L478 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 8 treesize of output 7 [2018-12-08 11:03:08,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:08,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:08,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 11:03:08,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:55, output treesize:44 [2018-12-08 11:03:08,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 13 [2018-12-08 11:03:08,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 11:03:08,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:08,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:08,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-12-08 11:03:08,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:03:08,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:08,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:08,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 11:03:08,462 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:58, output treesize:36 [2018-12-08 11:03:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:08,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:03:08,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 72 [2018-12-08 11:03:08,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-08 11:03:08,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-08 11:03:08,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=5023, Unknown=3, NotChecked=0, Total=5256 [2018-12-08 11:03:08,670 INFO L87 Difference]: Start difference. First operand 702 states and 820 transitions. Second operand 73 states. [2018-12-08 11:03:18,823 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-08 11:03:18,823 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:651) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:255) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:270) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-12-08 11:03:18,826 INFO L168 Benchmark]: Toolchain (without parser) took 434210.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 950.6 MB in the beginning and 813.6 MB in the end (delta: 137.0 MB). Peak memory consumption was 267.0 MB. Max. memory is 11.5 GB. [2018-12-08 11:03:18,826 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:03:18,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -129.6 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-12-08 11:03:18,827 INFO L168 Benchmark]: Boogie Preprocessor took 42.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-12-08 11:03:18,827 INFO L168 Benchmark]: RCFGBuilder took 515.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.7 MB in the end (delta: 90.5 MB). Peak memory consumption was 90.5 MB. Max. memory is 11.5 GB. [2018-12-08 11:03:18,827 INFO L168 Benchmark]: TraceAbstraction took 433377.21 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 33.6 MB). Free memory was 983.3 MB in the beginning and 813.6 MB in the end (delta: 169.7 MB). Peak memory consumption was 203.2 MB. Max. memory is 11.5 GB. [2018-12-08 11:03:18,828 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -129.6 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 515.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.7 MB in the end (delta: 90.5 MB). Peak memory consumption was 90.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 433377.21 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 33.6 MB). Free memory was 983.3 MB in the beginning and 813.6 MB in the end (delta: 169.7 MB). Peak memory consumption was 203.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 11:03:19,900 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 11:03:19,901 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 11:03:19,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 11:03:19,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 11:03:19,908 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 11:03:19,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 11:03:19,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 11:03:19,910 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 11:03:19,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 11:03:19,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 11:03:19,911 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 11:03:19,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 11:03:19,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 11:03:19,912 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 11:03:19,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 11:03:19,913 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 11:03:19,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 11:03:19,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 11:03:19,916 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 11:03:19,917 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 11:03:19,918 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 11:03:19,919 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 11:03:19,919 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 11:03:19,919 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 11:03:19,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 11:03:19,920 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 11:03:19,921 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 11:03:19,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 11:03:19,922 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 11:03:19,922 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 11:03:19,923 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 11:03:19,923 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 11:03:19,923 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 11:03:19,923 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 11:03:19,924 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 11:03:19,924 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-12-08 11:03:19,931 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 11:03:19,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 11:03:19,931 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 11:03:19,932 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 11:03:19,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 11:03:19,932 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 11:03:19,932 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 11:03:19,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 11:03:19,932 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 11:03:19,932 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 11:03:19,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 11:03:19,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 11:03:19,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 11:03:19,933 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 11:03:19,933 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 11:03:19,933 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 11:03:19,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 11:03:19,933 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 11:03:19,933 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 11:03:19,933 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 11:03:19,933 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 11:03:19,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 11:03:19,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 11:03:19,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 11:03:19,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 11:03:19,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 11:03:19,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 11:03:19,934 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 11:03:19,934 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-08 11:03:19,934 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 11:03:19,934 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 11:03:19,934 INFO L133 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/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/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 -> e6399ca05df7547b7620299987a8a06e9e2c006b [2018-12-08 11:03:19,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 11:03:19,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 11:03:19,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 11:03:19,962 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 11:03:19,962 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 11:03:19,963 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/../../sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-12-08 11:03:19,997 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/data/f6463ea28/bf489ff279de408cbcf9560c53582ff3/FLAG25fddf49e [2018-12-08 11:03:20,440 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 11:03:20,441 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/sv-benchmarks/c/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-12-08 11:03:20,447 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/data/f6463ea28/bf489ff279de408cbcf9560c53582ff3/FLAG25fddf49e [2018-12-08 11:03:20,455 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/data/f6463ea28/bf489ff279de408cbcf9560c53582ff3 [2018-12-08 11:03:20,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 11:03:20,458 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-08 11:03:20,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 11:03:20,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 11:03:20,462 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 11:03:20,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:03:20" (1/1) ... [2018-12-08 11:03:20,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397a44ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:20, skipping insertion in model container [2018-12-08 11:03:20,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:03:20" (1/1) ... [2018-12-08 11:03:20,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 11:03:20,497 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 11:03:20,696 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:03:20,703 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 11:03:20,772 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 11:03:20,795 INFO L195 MainTranslator]: Completed translation [2018-12-08 11:03:20,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:20 WrapperNode [2018-12-08 11:03:20,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 11:03:20,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 11:03:20,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 11:03:20,796 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 11:03:20,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:20" (1/1) ... [2018-12-08 11:03:20,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:20" (1/1) ... [2018-12-08 11:03:20,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:20" (1/1) ... [2018-12-08 11:03:20,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:20" (1/1) ... [2018-12-08 11:03:20,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:20" (1/1) ... [2018-12-08 11:03:20,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:20" (1/1) ... [2018-12-08 11:03:20,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:20" (1/1) ... [2018-12-08 11:03:20,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 11:03:20,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 11:03:20,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 11:03:20,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 11:03:20,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/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 [2018-12-08 11:03:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 11:03:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 11:03:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-08 11:03:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-08 11:03:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-12-08 11:03:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-12-08 11:03:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-12-08 11:03:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-12-08 11:03:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-12-08 11:03:20,873 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-12-08 11:03:20,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 11:03:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-08 11:03:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-08 11:03:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-08 11:03:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-08 11:03:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-08 11:03:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-08 11:03:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-08 11:03:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-08 11:03:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-08 11:03:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-08 11:03:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-08 11:03:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-08 11:03:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-08 11:03:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-08 11:03:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-08 11:03:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-08 11:03:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-08 11:03:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-08 11:03:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-08 11:03:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-08 11:03:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-08 11:03:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-08 11:03:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-08 11:03:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-08 11:03:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-08 11:03:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-08 11:03:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-08 11:03:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-08 11:03:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-08 11:03:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-08 11:03:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-08 11:03:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-08 11:03:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-08 11:03:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-08 11:03:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-08 11:03:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-08 11:03:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-08 11:03:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-08 11:03:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-08 11:03:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-08 11:03:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-08 11:03:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-08 11:03:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-08 11:03:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-08 11:03:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-08 11:03:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-08 11:03:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-08 11:03:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-08 11:03:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-08 11:03:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-08 11:03:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-08 11:03:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-08 11:03:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-08 11:03:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-08 11:03:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-08 11:03:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-08 11:03:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-08 11:03:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-08 11:03:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-08 11:03:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-08 11:03:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-08 11:03:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-08 11:03:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-08 11:03:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-08 11:03:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-08 11:03:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-08 11:03:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-08 11:03:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-08 11:03:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-08 11:03:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-08 11:03:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-08 11:03:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-08 11:03:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-08 11:03:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-08 11:03:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-08 11:03:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-08 11:03:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-08 11:03:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-08 11:03:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-08 11:03:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-08 11:03:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-08 11:03:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-08 11:03:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-08 11:03:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-08 11:03:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-08 11:03:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-08 11:03:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-08 11:03:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-08 11:03:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-08 11:03:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-08 11:03:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-08 11:03:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-08 11:03:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-08 11:03:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-08 11:03:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-08 11:03:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-08 11:03:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-08 11:03:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-08 11:03:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-08 11:03:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-08 11:03:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-08 11:03:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-08 11:03:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-08 11:03:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-08 11:03:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-12-08 11:03:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-12-08 11:03:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 11:03:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 11:03:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2018-12-08 11:03:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 11:03:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-08 11:03:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 11:03:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-12-08 11:03:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2018-12-08 11:03:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2018-12-08 11:03:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 11:03:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-08 11:03:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 11:03:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 11:03:21,591 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 11:03:21,591 INFO L280 CfgBuilder]: Removed 33 assue(true) statements. [2018-12-08 11:03:21,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:03:21 BoogieIcfgContainer [2018-12-08 11:03:21,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 11:03:21,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 11:03:21,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 11:03:21,594 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 11:03:21,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 11:03:20" (1/3) ... [2018-12-08 11:03:21,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d98eb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:03:21, skipping insertion in model container [2018-12-08 11:03:21,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:20" (2/3) ... [2018-12-08 11:03:21,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d98eb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:03:21, skipping insertion in model container [2018-12-08 11:03:21,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:03:21" (3/3) ... [2018-12-08 11:03:21,596 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_true-unreach-call_true-valid-memsafety.i [2018-12-08 11:03:21,601 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 11:03:21,606 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-12-08 11:03:21,615 INFO L257 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2018-12-08 11:03:21,629 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 11:03:21,629 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 11:03:21,630 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 11:03:21,630 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 11:03:21,630 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 11:03:21,630 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 11:03:21,630 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 11:03:21,630 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 11:03:21,630 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 11:03:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states. [2018-12-08 11:03:21,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 11:03:21,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:21,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:21,650 INFO L423 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:21,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:21,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1960808060, now seen corresponding path program 1 times [2018-12-08 11:03:21,655 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:21,656 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/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 [2018-12-08 11:03:21,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:21,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:21,705 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:21,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:21,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 11:03:21,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 11:03:21,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 11:03:21,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 11:03:21,719 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 2 states. [2018-12-08 11:03:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:21,739 INFO L93 Difference]: Finished difference Result 268 states and 293 transitions. [2018-12-08 11:03:21,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 11:03:21,740 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-08 11:03:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:21,747 INFO L225 Difference]: With dead ends: 268 [2018-12-08 11:03:21,747 INFO L226 Difference]: Without dead ends: 251 [2018-12-08 11:03:21,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 11:03:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-08 11:03:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-12-08 11:03:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-08 11:03:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 264 transitions. [2018-12-08 11:03:21,785 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 264 transitions. Word has length 9 [2018-12-08 11:03:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:21,785 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 264 transitions. [2018-12-08 11:03:21,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 11:03:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 264 transitions. [2018-12-08 11:03:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 11:03:21,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:21,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:21,786 INFO L423 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:21,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1960836890, now seen corresponding path program 1 times [2018-12-08 11:03:21,786 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:21,787 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:21,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:21,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:21,825 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:21,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:21,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 11:03:21,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:03:21,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:03:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:03:21,828 INFO L87 Difference]: Start difference. First operand 251 states and 264 transitions. Second operand 3 states. [2018-12-08 11:03:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:22,166 INFO L93 Difference]: Finished difference Result 290 states and 312 transitions. [2018-12-08 11:03:22,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:03:22,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-08 11:03:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:22,168 INFO L225 Difference]: With dead ends: 290 [2018-12-08 11:03:22,168 INFO L226 Difference]: Without dead ends: 289 [2018-12-08 11:03:22,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:03:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-08 11:03:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 253. [2018-12-08 11:03:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-08 11:03:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 267 transitions. [2018-12-08 11:03:22,184 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 267 transitions. Word has length 9 [2018-12-08 11:03:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:22,184 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 267 transitions. [2018-12-08 11:03:22,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:03:22,184 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 267 transitions. [2018-12-08 11:03:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 11:03:22,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:22,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:22,185 INFO L423 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:22,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1960835880, now seen corresponding path program 1 times [2018-12-08 11:03:22,186 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:22,186 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:22,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:22,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:22,231 INFO L478 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 [2018-12-08 11:03:22,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:22,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:22,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 11:03:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:22,238 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:22,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:22,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 11:03:22,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:03:22,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:03:22,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:03:22,240 INFO L87 Difference]: Start difference. First operand 253 states and 267 transitions. Second operand 3 states. [2018-12-08 11:03:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:22,492 INFO L93 Difference]: Finished difference Result 268 states and 285 transitions. [2018-12-08 11:03:22,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:03:22,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-08 11:03:22,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:22,493 INFO L225 Difference]: With dead ends: 268 [2018-12-08 11:03:22,494 INFO L226 Difference]: Without dead ends: 268 [2018-12-08 11:03:22,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:03:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-12-08 11:03:22,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 251. [2018-12-08 11:03:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-08 11:03:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 265 transitions. [2018-12-08 11:03:22,504 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 265 transitions. Word has length 9 [2018-12-08 11:03:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:22,504 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 265 transitions. [2018-12-08 11:03:22,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:03:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 265 transitions. [2018-12-08 11:03:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 11:03:22,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:22,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:22,505 INFO L423 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:22,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:22,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1960835879, now seen corresponding path program 1 times [2018-12-08 11:03:22,506 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:22,506 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:22,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:22,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:22,541 INFO L478 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 [2018-12-08 11:03:22,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:22,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:22,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 11:03:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:22,558 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:22,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:22,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 11:03:22,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:03:22,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:03:22,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:03:22,560 INFO L87 Difference]: Start difference. First operand 251 states and 265 transitions. Second operand 3 states. [2018-12-08 11:03:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:22,882 INFO L93 Difference]: Finished difference Result 276 states and 294 transitions. [2018-12-08 11:03:22,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:03:22,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-08 11:03:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:22,884 INFO L225 Difference]: With dead ends: 276 [2018-12-08 11:03:22,884 INFO L226 Difference]: Without dead ends: 276 [2018-12-08 11:03:22,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:03:22,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-12-08 11:03:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 249. [2018-12-08 11:03:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-08 11:03:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 263 transitions. [2018-12-08 11:03:22,888 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 263 transitions. Word has length 9 [2018-12-08 11:03:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:22,888 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 263 transitions. [2018-12-08 11:03:22,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:03:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 263 transitions. [2018-12-08 11:03:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 11:03:22,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:22,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:22,889 INFO L423 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:22,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash 236834890, now seen corresponding path program 1 times [2018-12-08 11:03:22,889 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:22,889 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:22,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:22,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:22,919 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:22,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:22,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 11:03:22,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:03:22,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:03:22,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:03:22,921 INFO L87 Difference]: Start difference. First operand 249 states and 263 transitions. Second operand 3 states. [2018-12-08 11:03:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:22,957 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2018-12-08 11:03:22,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:03:22,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 11:03:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:22,959 INFO L225 Difference]: With dead ends: 263 [2018-12-08 11:03:22,959 INFO L226 Difference]: Without dead ends: 262 [2018-12-08 11:03:22,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:03:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-08 11:03:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 248. [2018-12-08 11:03:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-08 11:03:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 261 transitions. [2018-12-08 11:03:22,966 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 261 transitions. Word has length 13 [2018-12-08 11:03:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:22,967 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 261 transitions. [2018-12-08 11:03:22,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:03:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 261 transitions. [2018-12-08 11:03:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 11:03:22,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:22,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:22,968 INFO L423 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:22,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:22,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1075447581, now seen corresponding path program 1 times [2018-12-08 11:03:22,969 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:22,969 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:22,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:23,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:23,020 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-08 11:03:23,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:23,024 INFO L267 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. [2018-12-08 11:03:23,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-08 11:03:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:23,031 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:23,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:23,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 11:03:23,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:03:23,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:03:23,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:03:23,034 INFO L87 Difference]: Start difference. First operand 248 states and 261 transitions. Second operand 4 states. [2018-12-08 11:03:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:23,433 INFO L93 Difference]: Finished difference Result 277 states and 294 transitions. [2018-12-08 11:03:23,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 11:03:23,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-08 11:03:23,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:23,434 INFO L225 Difference]: With dead ends: 277 [2018-12-08 11:03:23,434 INFO L226 Difference]: Without dead ends: 277 [2018-12-08 11:03:23,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:03:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-08 11:03:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 246. [2018-12-08 11:03:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-12-08 11:03:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 259 transitions. [2018-12-08 11:03:23,440 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 259 transitions. Word has length 13 [2018-12-08 11:03:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:23,440 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 259 transitions. [2018-12-08 11:03:23,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:03:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 259 transitions. [2018-12-08 11:03:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 11:03:23,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:23,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:23,441 INFO L423 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:23,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:23,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1075447582, now seen corresponding path program 1 times [2018-12-08 11:03:23,442 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:23,442 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:23,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:23,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:23,496 INFO L478 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 [2018-12-08 11:03:23,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:23,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:23,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 11:03:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:23,512 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:23,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:23,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 11:03:23,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 11:03:23,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 11:03:23,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:03:23,514 INFO L87 Difference]: Start difference. First operand 246 states and 259 transitions. Second operand 3 states. [2018-12-08 11:03:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:23,825 INFO L93 Difference]: Finished difference Result 274 states and 290 transitions. [2018-12-08 11:03:23,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 11:03:23,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 11:03:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:23,826 INFO L225 Difference]: With dead ends: 274 [2018-12-08 11:03:23,826 INFO L226 Difference]: Without dead ends: 274 [2018-12-08 11:03:23,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 11:03:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-08 11:03:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 244. [2018-12-08 11:03:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-12-08 11:03:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 257 transitions. [2018-12-08 11:03:23,831 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 257 transitions. Word has length 13 [2018-12-08 11:03:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:23,831 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 257 transitions. [2018-12-08 11:03:23,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 11:03:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 257 transitions. [2018-12-08 11:03:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 11:03:23,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:23,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:23,832 INFO L423 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:23,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash -90615826, now seen corresponding path program 1 times [2018-12-08 11:03:23,832 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:23,833 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:23,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:23,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:23,869 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:23,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:23,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 11:03:23,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 11:03:23,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 11:03:23,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 11:03:23,871 INFO L87 Difference]: Start difference. First operand 244 states and 257 transitions. Second operand 4 states. [2018-12-08 11:03:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:23,942 INFO L93 Difference]: Finished difference Result 278 states and 294 transitions. [2018-12-08 11:03:23,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 11:03:23,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-08 11:03:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:23,943 INFO L225 Difference]: With dead ends: 278 [2018-12-08 11:03:23,943 INFO L226 Difference]: Without dead ends: 278 [2018-12-08 11:03:23,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 11:03:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-08 11:03:23,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 244. [2018-12-08 11:03:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-12-08 11:03:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 256 transitions. [2018-12-08 11:03:23,947 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 256 transitions. Word has length 18 [2018-12-08 11:03:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:23,947 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 256 transitions. [2018-12-08 11:03:23,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 11:03:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 256 transitions. [2018-12-08 11:03:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 11:03:23,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:23,947 INFO L402 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] [2018-12-08 11:03:23,948 INFO L423 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:23,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:23,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1925733202, now seen corresponding path program 1 times [2018-12-08 11:03:23,948 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:23,948 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:23,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:24,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:24,014 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-08 11:03:24,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:24,018 INFO L267 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. [2018-12-08 11:03:24,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-08 11:03:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:24,045 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:24,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:24,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:03:24,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:03:24,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:03:24,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:03:24,047 INFO L87 Difference]: Start difference. First operand 244 states and 256 transitions. Second operand 7 states. [2018-12-08 11:03:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:24,989 INFO L93 Difference]: Finished difference Result 267 states and 284 transitions. [2018-12-08 11:03:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:03:24,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-08 11:03:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:24,990 INFO L225 Difference]: With dead ends: 267 [2018-12-08 11:03:24,990 INFO L226 Difference]: Without dead ends: 267 [2018-12-08 11:03:24,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:03:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-08 11:03:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 237. [2018-12-08 11:03:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-08 11:03:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 251 transitions. [2018-12-08 11:03:24,994 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 251 transitions. Word has length 22 [2018-12-08 11:03:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:24,995 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 251 transitions. [2018-12-08 11:03:24,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:03:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 251 transitions. [2018-12-08 11:03:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 11:03:24,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:24,995 INFO L402 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] [2018-12-08 11:03:24,996 INFO L423 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:24,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:24,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1925733203, now seen corresponding path program 1 times [2018-12-08 11:03:24,996 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:24,996 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:25,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:25,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:25,068 INFO L478 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 [2018-12-08 11:03:25,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:25,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:25,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 11:03:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:25,101 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:25,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:25,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 11:03:25,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 11:03:25,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 11:03:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 11:03:25,104 INFO L87 Difference]: Start difference. First operand 237 states and 251 transitions. Second operand 6 states. [2018-12-08 11:03:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:26,177 INFO L93 Difference]: Finished difference Result 297 states and 313 transitions. [2018-12-08 11:03:26,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 11:03:26,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-08 11:03:26,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:26,179 INFO L225 Difference]: With dead ends: 297 [2018-12-08 11:03:26,179 INFO L226 Difference]: Without dead ends: 297 [2018-12-08 11:03:26,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 11:03:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-08 11:03:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 265. [2018-12-08 11:03:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-08 11:03:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 282 transitions. [2018-12-08 11:03:26,185 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 282 transitions. Word has length 22 [2018-12-08 11:03:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:26,186 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 282 transitions. [2018-12-08 11:03:26,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 11:03:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 282 transitions. [2018-12-08 11:03:26,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 11:03:26,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:26,187 INFO L402 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] [2018-12-08 11:03:26,187 INFO L423 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:26,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:26,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1445799933, now seen corresponding path program 1 times [2018-12-08 11:03:26,188 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:26,188 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:26,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:26,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:26,267 INFO L478 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 [2018-12-08 11:03:26,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:26,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:26,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 11:03:26,276 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-08 11:03:26,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:26,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:26,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:14 [2018-12-08 11:03:26,292 INFO L478 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 11 treesize of output 8 [2018-12-08 11:03:26,294 INFO L478 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 8 treesize of output 7 [2018-12-08 11:03:26,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:26,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:26,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:26,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-12-08 11:03:26,318 INFO L478 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 25 treesize of output 20 [2018-12-08 11:03:26,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:26,323 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-08 11:03:26,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:26,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:26,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:26,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-12-08 11:03:26,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 11:03:26,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-08 11:03:26,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:26,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:26,387 INFO L267 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. [2018-12-08 11:03:26,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-08 11:03:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:26,408 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:26,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:26,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 11:03:26,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 11:03:26,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 11:03:26,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:03:26,411 INFO L87 Difference]: Start difference. First operand 265 states and 282 transitions. Second operand 9 states. [2018-12-08 11:03:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:27,735 INFO L93 Difference]: Finished difference Result 280 states and 296 transitions. [2018-12-08 11:03:27,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 11:03:27,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-08 11:03:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:27,736 INFO L225 Difference]: With dead ends: 280 [2018-12-08 11:03:27,736 INFO L226 Difference]: Without dead ends: 280 [2018-12-08 11:03:27,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-08 11:03:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-08 11:03:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 266. [2018-12-08 11:03:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 11:03:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 284 transitions. [2018-12-08 11:03:27,742 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 284 transitions. Word has length 33 [2018-12-08 11:03:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:27,743 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 284 transitions. [2018-12-08 11:03:27,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 11:03:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 284 transitions. [2018-12-08 11:03:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 11:03:27,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:27,744 INFO L402 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] [2018-12-08 11:03:27,744 INFO L423 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:27,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1445799932, now seen corresponding path program 1 times [2018-12-08 11:03:27,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:27,745 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:27,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:27,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:27,853 INFO L478 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 [2018-12-08 11:03:27,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:27,860 INFO L478 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 [2018-12-08 11:03:27,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:27,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:27,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 11:03:27,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:27,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:27,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-08 11:03:27,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:27,898 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-08 11:03:27,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:27,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:27,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-12-08 11:03:27,928 INFO L478 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 11 treesize of output 8 [2018-12-08 11:03:27,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 11:03:27,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:27,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:27,954 INFO L478 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 11 treesize of output 8 [2018-12-08 11:03:27,956 INFO L478 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 8 treesize of output 7 [2018-12-08 11:03:27,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:27,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:27,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:27,969 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-12-08 11:03:27,992 INFO L478 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 33 treesize of output 26 [2018-12-08 11:03:27,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:27,999 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-08 11:03:28,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:28,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:28,039 INFO L478 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 21 treesize of output 16 [2018-12-08 11:03:28,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:28,047 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 11:03:28,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:28,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:28,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:28,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:37 [2018-12-08 11:03:28,155 INFO L478 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 11 [2018-12-08 11:03:28,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:03:28,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:28,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:28,169 INFO L478 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 27 treesize of output 21 [2018-12-08 11:03:28,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 12 [2018-12-08 11:03:28,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:28,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:28,184 INFO L267 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. [2018-12-08 11:03:28,184 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2018-12-08 11:03:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:28,210 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:28,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:28,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 11:03:28,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 11:03:28,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 11:03:28,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:03:28,213 INFO L87 Difference]: Start difference. First operand 266 states and 284 transitions. Second operand 9 states. [2018-12-08 11:03:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:30,149 INFO L93 Difference]: Finished difference Result 289 states and 305 transitions. [2018-12-08 11:03:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 11:03:30,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-08 11:03:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:30,150 INFO L225 Difference]: With dead ends: 289 [2018-12-08 11:03:30,151 INFO L226 Difference]: Without dead ends: 289 [2018-12-08 11:03:30,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-08 11:03:30,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-08 11:03:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 266. [2018-12-08 11:03:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 11:03:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 283 transitions. [2018-12-08 11:03:30,154 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 283 transitions. Word has length 33 [2018-12-08 11:03:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:30,155 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 283 transitions. [2018-12-08 11:03:30,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 11:03:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 283 transitions. [2018-12-08 11:03:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 11:03:30,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:30,155 INFO L402 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] [2018-12-08 11:03:30,156 INFO L423 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:30,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:30,156 INFO L82 PathProgramCache]: Analyzing trace with hash 647690661, now seen corresponding path program 1 times [2018-12-08 11:03:30,156 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:30,156 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:30,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:30,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:30,257 INFO L478 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 13 treesize of output 10 [2018-12-08 11:03:30,259 INFO L478 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 10 treesize of output 9 [2018-12-08 11:03:30,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:30,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:30,270 INFO L478 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 13 treesize of output 10 [2018-12-08 11:03:30,272 INFO L478 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 10 treesize of output 9 [2018-12-08 11:03:30,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:30,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:30,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:30,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-12-08 11:03:30,352 INFO L478 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 11 [2018-12-08 11:03:30,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:03:30,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:30,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:30,365 INFO L478 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 11 [2018-12-08 11:03:30,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:03:30,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:30,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:30,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:30,371 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-08 11:03:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:30,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 11:03:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:30,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:03:30,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-12-08 11:03:30,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 11:03:30,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 11:03:30,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-08 11:03:30,500 INFO L87 Difference]: Start difference. First operand 266 states and 283 transitions. Second operand 13 states. [2018-12-08 11:03:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:31,882 INFO L93 Difference]: Finished difference Result 323 states and 344 transitions. [2018-12-08 11:03:31,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 11:03:31,883 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-08 11:03:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:31,885 INFO L225 Difference]: With dead ends: 323 [2018-12-08 11:03:31,885 INFO L226 Difference]: Without dead ends: 319 [2018-12-08 11:03:31,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-12-08 11:03:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-08 11:03:31,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 296. [2018-12-08 11:03:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-08 11:03:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 314 transitions. [2018-12-08 11:03:31,891 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 314 transitions. Word has length 33 [2018-12-08 11:03:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:31,891 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 314 transitions. [2018-12-08 11:03:31,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 11:03:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 314 transitions. [2018-12-08 11:03:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 11:03:31,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:31,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:31,892 INFO L423 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:31,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:31,893 INFO L82 PathProgramCache]: Analyzing trace with hash 923676802, now seen corresponding path program 1 times [2018-12-08 11:03:31,893 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:31,893 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:31,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:31,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:32,005 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-08 11:03:32,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:32,010 INFO L267 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. [2018-12-08 11:03:32,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-08 11:03:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:32,062 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:32,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:32,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:03:32,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:03:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:03:32,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:03:32,065 INFO L87 Difference]: Start difference. First operand 296 states and 314 transitions. Second operand 7 states. [2018-12-08 11:03:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:32,923 INFO L93 Difference]: Finished difference Result 321 states and 345 transitions. [2018-12-08 11:03:32,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 11:03:32,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-12-08 11:03:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:32,924 INFO L225 Difference]: With dead ends: 321 [2018-12-08 11:03:32,924 INFO L226 Difference]: Without dead ends: 321 [2018-12-08 11:03:32,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:03:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-08 11:03:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 296. [2018-12-08 11:03:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-08 11:03:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 316 transitions. [2018-12-08 11:03:32,929 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 316 transitions. Word has length 43 [2018-12-08 11:03:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:32,929 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 316 transitions. [2018-12-08 11:03:32,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:03:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 316 transitions. [2018-12-08 11:03:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 11:03:32,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:32,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:32,930 INFO L423 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:32,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:32,930 INFO L82 PathProgramCache]: Analyzing trace with hash 923676803, now seen corresponding path program 1 times [2018-12-08 11:03:32,930 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:32,931 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:32,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:33,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:33,055 INFO L478 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 13 treesize of output 10 [2018-12-08 11:03:33,057 INFO L478 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 10 treesize of output 9 [2018-12-08 11:03:33,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:33,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:33,077 INFO L478 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 13 treesize of output 10 [2018-12-08 11:03:33,079 INFO L478 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 10 treesize of output 9 [2018-12-08 11:03:33,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:33,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:33,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:33,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-12-08 11:03:33,150 INFO L478 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 11 [2018-12-08 11:03:33,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:03:33,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:33,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:33,160 INFO L478 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 11 [2018-12-08 11:03:33,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:03:33,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:33,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:33,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:33,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-08 11:03:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:33,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 11:03:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:33,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:03:33,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-12-08 11:03:33,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 11:03:33,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 11:03:33,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=67, Unknown=1, NotChecked=0, Total=90 [2018-12-08 11:03:33,224 INFO L87 Difference]: Start difference. First operand 296 states and 316 transitions. Second operand 10 states. [2018-12-08 11:03:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:33,939 INFO L93 Difference]: Finished difference Result 351 states and 372 transitions. [2018-12-08 11:03:33,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:03:33,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-08 11:03:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:33,940 INFO L225 Difference]: With dead ends: 351 [2018-12-08 11:03:33,940 INFO L226 Difference]: Without dead ends: 351 [2018-12-08 11:03:33,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=110, Unknown=1, NotChecked=0, Total=156 [2018-12-08 11:03:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-08 11:03:33,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 320. [2018-12-08 11:03:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-08 11:03:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 353 transitions. [2018-12-08 11:03:33,943 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 353 transitions. Word has length 43 [2018-12-08 11:03:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:33,943 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 353 transitions. [2018-12-08 11:03:33,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 11:03:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 353 transitions. [2018-12-08 11:03:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 11:03:33,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:33,944 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:33,944 INFO L423 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:33,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:33,944 INFO L82 PathProgramCache]: Analyzing trace with hash 72986797, now seen corresponding path program 2 times [2018-12-08 11:03:33,944 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:33,944 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:33,963 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 11:03:34,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 11:03:34,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:03:34,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:34,062 INFO L478 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 [2018-12-08 11:03:34,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:34,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:34,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 11:03:34,069 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-08 11:03:34,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:34,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:34,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:14 [2018-12-08 11:03:34,085 INFO L478 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 11 treesize of output 8 [2018-12-08 11:03:34,086 INFO L478 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 8 treesize of output 7 [2018-12-08 11:03:34,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:34,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:34,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:34,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-12-08 11:03:34,109 INFO L478 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 25 treesize of output 20 [2018-12-08 11:03:34,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:34,113 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-12-08 11:03:34,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:34,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:34,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:34,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-12-08 11:03:34,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 11:03:34,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-08 11:03:34,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:34,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:34,186 INFO L267 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. [2018-12-08 11:03:34,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-08 11:03:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 11:03:34,203 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:34,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:34,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 11:03:34,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 11:03:34,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 11:03:34,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:03:34,206 INFO L87 Difference]: Start difference. First operand 320 states and 353 transitions. Second operand 9 states. [2018-12-08 11:03:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:35,508 INFO L93 Difference]: Finished difference Result 328 states and 360 transitions. [2018-12-08 11:03:35,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 11:03:35,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-12-08 11:03:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:35,509 INFO L225 Difference]: With dead ends: 328 [2018-12-08 11:03:35,509 INFO L226 Difference]: Without dead ends: 328 [2018-12-08 11:03:35,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-08 11:03:35,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-08 11:03:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 320. [2018-12-08 11:03:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-08 11:03:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 352 transitions. [2018-12-08 11:03:35,513 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 352 transitions. Word has length 42 [2018-12-08 11:03:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:35,513 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 352 transitions. [2018-12-08 11:03:35,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 11:03:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 352 transitions. [2018-12-08 11:03:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 11:03:35,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:35,514 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:35,514 INFO L423 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:35,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash 72986798, now seen corresponding path program 1 times [2018-12-08 11:03:35,514 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:35,514 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:35,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:03:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:35,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:35,670 INFO L478 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 [2018-12-08 11:03:35,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,676 INFO L478 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 [2018-12-08 11:03:35,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 11:03:35,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:35,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:35,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-08 11:03:35,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,701 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-08 11:03:35,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-12-08 11:03:35,729 INFO L478 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 11 treesize of output 8 [2018-12-08 11:03:35,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 11:03:35,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,752 INFO L478 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 11 treesize of output 8 [2018-12-08 11:03:35,754 INFO L478 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 8 treesize of output 7 [2018-12-08 11:03:35,754 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-12-08 11:03:35,793 INFO L478 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 33 treesize of output 26 [2018-12-08 11:03:35,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:35,801 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-12-08 11:03:35,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,842 INFO L478 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 21 treesize of output 16 [2018-12-08 11:03:35,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:35,850 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 11:03:35,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,875 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:37 [2018-12-08 11:03:35,939 INFO L478 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 11 [2018-12-08 11:03:35,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:03:35,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,952 INFO L478 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 27 treesize of output 21 [2018-12-08 11:03:35,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 12 [2018-12-08 11:03:35,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:35,965 INFO L267 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. [2018-12-08 11:03:35,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2018-12-08 11:03:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 11:03:35,991 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:35,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:35,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 11:03:35,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 11:03:35,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 11:03:35,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:03:35,994 INFO L87 Difference]: Start difference. First operand 320 states and 352 transitions. Second operand 9 states. [2018-12-08 11:03:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:37,887 INFO L93 Difference]: Finished difference Result 339 states and 371 transitions. [2018-12-08 11:03:37,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 11:03:37,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-12-08 11:03:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:37,888 INFO L225 Difference]: With dead ends: 339 [2018-12-08 11:03:37,889 INFO L226 Difference]: Without dead ends: 339 [2018-12-08 11:03:37,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-08 11:03:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-08 11:03:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 320. [2018-12-08 11:03:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-08 11:03:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 351 transitions. [2018-12-08 11:03:37,892 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 351 transitions. Word has length 42 [2018-12-08 11:03:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:37,892 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 351 transitions. [2018-12-08 11:03:37,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 11:03:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 351 transitions. [2018-12-08 11:03:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 11:03:37,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:37,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:37,893 INFO L423 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:37,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1495651579, now seen corresponding path program 1 times [2018-12-08 11:03:37,893 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:37,893 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:37,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:37,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:37,982 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-08 11:03:37,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:37,986 INFO L267 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. [2018-12-08 11:03:37,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-08 11:03:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:38,023 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:38,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:38,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:03:38,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:03:38,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:03:38,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:03:38,026 INFO L87 Difference]: Start difference. First operand 320 states and 351 transitions. Second operand 7 states. [2018-12-08 11:03:38,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:38,830 INFO L93 Difference]: Finished difference Result 327 states and 356 transitions. [2018-12-08 11:03:38,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 11:03:38,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-12-08 11:03:38,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:38,831 INFO L225 Difference]: With dead ends: 327 [2018-12-08 11:03:38,832 INFO L226 Difference]: Without dead ends: 327 [2018-12-08 11:03:38,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:03:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-08 11:03:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2018-12-08 11:03:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-12-08 11:03:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 345 transitions. [2018-12-08 11:03:38,835 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 345 transitions. Word has length 44 [2018-12-08 11:03:38,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:38,835 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 345 transitions. [2018-12-08 11:03:38,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:03:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 345 transitions. [2018-12-08 11:03:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 11:03:38,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:38,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:38,836 INFO L423 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:38,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1495651578, now seen corresponding path program 1 times [2018-12-08 11:03:38,836 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:38,836 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:38,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:38,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:38,934 INFO L478 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 [2018-12-08 11:03:38,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:38,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:38,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 11:03:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:38,976 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:38,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:38,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 11:03:38,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:03:38,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:03:38,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:03:38,979 INFO L87 Difference]: Start difference. First operand 317 states and 345 transitions. Second operand 7 states. [2018-12-08 11:03:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:40,151 INFO L93 Difference]: Finished difference Result 432 states and 465 transitions. [2018-12-08 11:03:40,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:03:40,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-12-08 11:03:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:40,153 INFO L225 Difference]: With dead ends: 432 [2018-12-08 11:03:40,153 INFO L226 Difference]: Without dead ends: 432 [2018-12-08 11:03:40,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-08 11:03:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-12-08 11:03:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 316. [2018-12-08 11:03:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-12-08 11:03:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 340 transitions. [2018-12-08 11:03:40,159 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 340 transitions. Word has length 44 [2018-12-08 11:03:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:40,159 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 340 transitions. [2018-12-08 11:03:40,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:03:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 340 transitions. [2018-12-08 11:03:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 11:03:40,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:40,160 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:40,160 INFO L423 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:40,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:40,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1261287330, now seen corresponding path program 1 times [2018-12-08 11:03:40,161 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:40,161 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:40,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:40,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:40,308 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-08 11:03:40,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:40,312 INFO L267 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. [2018-12-08 11:03:40,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-08 11:03:40,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:40,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:40,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 11:03:40,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:40,335 INFO L267 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. [2018-12-08 11:03:40,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2018-12-08 11:03:40,352 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:03:40,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2018-12-08 11:03:40,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:40,361 INFO L267 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. [2018-12-08 11:03:40,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-12-08 11:03:40,380 INFO L478 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 13 treesize of output 10 [2018-12-08 11:03:40,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-08 11:03:40,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:40,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:40,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:03:40,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:39 [2018-12-08 11:03:40,487 INFO L478 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 27 treesize of output 21 [2018-12-08 11:03:40,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 12 [2018-12-08 11:03:40,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:40,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:40,499 INFO L267 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. [2018-12-08 11:03:40,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-12-08 11:03:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:40,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 11:03:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:40,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:03:40,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-12-08 11:03:40,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 11:03:40,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 11:03:40,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-12-08 11:03:40,792 INFO L87 Difference]: Start difference. First operand 316 states and 340 transitions. Second operand 21 states. [2018-12-08 11:03:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:44,266 INFO L93 Difference]: Finished difference Result 349 states and 375 transitions. [2018-12-08 11:03:44,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 11:03:44,266 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-12-08 11:03:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:44,267 INFO L225 Difference]: With dead ends: 349 [2018-12-08 11:03:44,267 INFO L226 Difference]: Without dead ends: 349 [2018-12-08 11:03:44,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2018-12-08 11:03:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-08 11:03:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 318. [2018-12-08 11:03:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-08 11:03:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 343 transitions. [2018-12-08 11:03:44,271 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 343 transitions. Word has length 47 [2018-12-08 11:03:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:44,272 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 343 transitions. [2018-12-08 11:03:44,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 11:03:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 343 transitions. [2018-12-08 11:03:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 11:03:44,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:44,272 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:44,272 INFO L423 AbstractCegarLoop]: === Iteration 21 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:44,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:44,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1261287331, now seen corresponding path program 1 times [2018-12-08 11:03:44,273 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:44,273 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:44,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:44,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:44,449 INFO L478 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 [2018-12-08 11:03:44,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,457 INFO L478 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 [2018-12-08 11:03:44,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 11:03:44,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:44,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:03:44,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 11:03:44,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,493 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-08 11:03:44,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,500 INFO L267 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. [2018-12-08 11:03:44,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-12-08 11:03:44,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-08 11:03:44,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,534 INFO L267 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. [2018-12-08 11:03:44,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2018-12-08 11:03:44,560 INFO L478 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 13 treesize of output 10 [2018-12-08 11:03:44,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2018-12-08 11:03:44,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,588 INFO L478 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 13 treesize of output 10 [2018-12-08 11:03:44,590 INFO L478 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 10 treesize of output 9 [2018-12-08 11:03:44,590 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,608 INFO L267 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. [2018-12-08 11:03:44,608 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:46 [2018-12-08 11:03:44,730 INFO L478 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 11 [2018-12-08 11:03:44,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:03:44,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,748 INFO L478 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 19 [2018-12-08 11:03:44,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 10 [2018-12-08 11:03:44,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:44,764 INFO L267 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. [2018-12-08 11:03:44,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 [2018-12-08 11:03:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:44,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 11:03:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:45,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:03:45,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-12-08 11:03:45,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-08 11:03:45,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-08 11:03:45,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-12-08 11:03:45,922 INFO L87 Difference]: Start difference. First operand 318 states and 343 transitions. Second operand 22 states. [2018-12-08 11:03:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:55,741 INFO L93 Difference]: Finished difference Result 394 states and 424 transitions. [2018-12-08 11:03:55,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 11:03:55,742 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-12-08 11:03:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:55,743 INFO L225 Difference]: With dead ends: 394 [2018-12-08 11:03:55,743 INFO L226 Difference]: Without dead ends: 394 [2018-12-08 11:03:55,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2018-12-08 11:03:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-12-08 11:03:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 334. [2018-12-08 11:03:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-12-08 11:03:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 359 transitions. [2018-12-08 11:03:55,746 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 359 transitions. Word has length 47 [2018-12-08 11:03:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:55,746 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 359 transitions. [2018-12-08 11:03:55,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-08 11:03:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 359 transitions. [2018-12-08 11:03:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 11:03:55,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:55,747 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:55,747 INFO L423 AbstractCegarLoop]: === Iteration 22 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:55,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:55,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1573274229, now seen corresponding path program 2 times [2018-12-08 11:03:55,747 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:55,747 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:55,762 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 11:03:55,813 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 11:03:55,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 11:03:55,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:55,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 11:03:55,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-08 11:03:55,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:55,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:55,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 11:03:55,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-08 11:03:55,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:55,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:55,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:55,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-12-08 11:03:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 11:03:55,898 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:55,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:55,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 11:03:55,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 11:03:55,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 11:03:55,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 11:03:55,900 INFO L87 Difference]: Start difference. First operand 334 states and 359 transitions. Second operand 7 states. [2018-12-08 11:03:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:56,602 INFO L93 Difference]: Finished difference Result 357 states and 383 transitions. [2018-12-08 11:03:56,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 11:03:56,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-08 11:03:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:56,605 INFO L225 Difference]: With dead ends: 357 [2018-12-08 11:03:56,605 INFO L226 Difference]: Without dead ends: 357 [2018-12-08 11:03:56,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-08 11:03:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-12-08 11:03:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 338. [2018-12-08 11:03:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-12-08 11:03:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 363 transitions. [2018-12-08 11:03:56,608 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 363 transitions. Word has length 52 [2018-12-08 11:03:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:56,609 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 363 transitions. [2018-12-08 11:03:56,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 11:03:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 363 transitions. [2018-12-08 11:03:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 11:03:56,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:56,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:56,609 INFO L423 AbstractCegarLoop]: === Iteration 23 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:56,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1369478970, now seen corresponding path program 1 times [2018-12-08 11:03:56,610 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:56,610 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:56,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 11:03:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:56,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:56,716 INFO L478 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 13 treesize of output 10 [2018-12-08 11:03:56,717 INFO L478 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 10 treesize of output 9 [2018-12-08 11:03:56,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:56,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:56,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:56,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-12-08 11:03:56,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-08 11:03:56,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 11:03:56,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:56,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:56,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:56,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-08 11:03:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:56,822 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:56,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:56,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 11:03:56,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 11:03:56,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 11:03:56,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-08 11:03:56,824 INFO L87 Difference]: Start difference. First operand 338 states and 363 transitions. Second operand 12 states. [2018-12-08 11:03:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:03:58,392 INFO L93 Difference]: Finished difference Result 370 states and 395 transitions. [2018-12-08 11:03:58,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 11:03:58,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-12-08 11:03:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:03:58,393 INFO L225 Difference]: With dead ends: 370 [2018-12-08 11:03:58,393 INFO L226 Difference]: Without dead ends: 370 [2018-12-08 11:03:58,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-12-08 11:03:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-12-08 11:03:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 359. [2018-12-08 11:03:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-08 11:03:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 388 transitions. [2018-12-08 11:03:58,397 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 388 transitions. Word has length 53 [2018-12-08 11:03:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:03:58,398 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 388 transitions. [2018-12-08 11:03:58,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 11:03:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 388 transitions. [2018-12-08 11:03:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 11:03:58,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:03:58,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:03:58,399 INFO L423 AbstractCegarLoop]: === Iteration 24 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:03:58,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:03:58,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1369478969, now seen corresponding path program 1 times [2018-12-08 11:03:58,399 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:03:58,399 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:03:58,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:03:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:03:58,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:03:58,554 INFO L478 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 13 treesize of output 10 [2018-12-08 11:03:58,557 INFO L478 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 10 treesize of output 9 [2018-12-08 11:03:58,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:58,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:58,579 INFO L478 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 13 treesize of output 10 [2018-12-08 11:03:58,581 INFO L478 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 10 treesize of output 9 [2018-12-08 11:03:58,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:58,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:58,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:58,596 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-12-08 11:03:58,814 INFO L478 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 43 treesize of output 33 [2018-12-08 11:03:58,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-12-08 11:03:58,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:58,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:58,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 11:03:58,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-08 11:03:58,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:03:58,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:58,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:03:58,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:16 [2018-12-08 11:03:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:03:58,976 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:03:58,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:03:58,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 11:03:58,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 11:03:58,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 11:03:58,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-08 11:03:58,978 INFO L87 Difference]: Start difference. First operand 359 states and 388 transitions. Second operand 12 states. [2018-12-08 11:04:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:04:01,820 INFO L93 Difference]: Finished difference Result 377 states and 400 transitions. [2018-12-08 11:04:01,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 11:04:01,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-12-08 11:04:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:04:01,822 INFO L225 Difference]: With dead ends: 377 [2018-12-08 11:04:01,822 INFO L226 Difference]: Without dead ends: 377 [2018-12-08 11:04:01,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-12-08 11:04:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-12-08 11:04:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2018-12-08 11:04:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-12-08 11:04:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 381 transitions. [2018-12-08 11:04:01,826 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 381 transitions. Word has length 53 [2018-12-08 11:04:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:04:01,826 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 381 transitions. [2018-12-08 11:04:01,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 11:04:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 381 transitions. [2018-12-08 11:04:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 11:04:01,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:04:01,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:04:01,828 INFO L423 AbstractCegarLoop]: === Iteration 25 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:04:01,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:04:01,828 INFO L82 PathProgramCache]: Analyzing trace with hash 733849436, now seen corresponding path program 1 times [2018-12-08 11:04:01,828 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:04:01,828 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:04:01,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:04:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:04:01,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:04:01,947 INFO L478 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 13 treesize of output 10 [2018-12-08 11:04:01,949 INFO L478 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 10 treesize of output 9 [2018-12-08 11:04:01,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:01,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:01,965 INFO L478 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 13 treesize of output 10 [2018-12-08 11:04:01,967 INFO L478 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 10 treesize of output 9 [2018-12-08 11:04:01,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:01,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:01,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:01,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-12-08 11:04:02,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 53 [2018-12-08 11:04:02,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-12-08 11:04:02,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:02,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-12-08 11:04:02,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:04:02,243 INFO L478 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 41 treesize of output 29 [2018-12-08 11:04:02,244 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:04:02,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 11:04:02,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-12-08 11:04:02,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:04:02,286 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:02,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2018-12-08 11:04:02,293 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:02,295 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:02,306 INFO L478 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 26 treesize of output 27 [2018-12-08 11:04:02,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-12-08 11:04:02,309 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:02,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 11 [2018-12-08 11:04:02,323 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:02,331 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:02,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:02,336 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:61, output treesize:7 [2018-12-08 11:04:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:04:02,361 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 11:04:02,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 11:04:02,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 11:04:02,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 11:04:02,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 11:04:02,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=149, Unknown=7, NotChecked=0, Total=182 [2018-12-08 11:04:02,364 INFO L87 Difference]: Start difference. First operand 357 states and 381 transitions. Second operand 14 states. [2018-12-08 11:04:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:04:04,561 INFO L93 Difference]: Finished difference Result 372 states and 394 transitions. [2018-12-08 11:04:04,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 11:04:04,562 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-12-08 11:04:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:04:04,563 INFO L225 Difference]: With dead ends: 372 [2018-12-08 11:04:04,563 INFO L226 Difference]: Without dead ends: 372 [2018-12-08 11:04:04,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=414, Unknown=18, NotChecked=0, Total=506 [2018-12-08 11:04:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-12-08 11:04:04,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 354. [2018-12-08 11:04:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-08 11:04:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 375 transitions. [2018-12-08 11:04:04,566 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 375 transitions. Word has length 57 [2018-12-08 11:04:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:04:04,566 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 375 transitions. [2018-12-08 11:04:04,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 11:04:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 375 transitions. [2018-12-08 11:04:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 11:04:04,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:04:04,567 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:04:04,567 INFO L423 AbstractCegarLoop]: === Iteration 26 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:04:04,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:04:04,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1329572275, now seen corresponding path program 1 times [2018-12-08 11:04:04,567 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:04:04,567 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:04:04,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:04:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:04:04,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:04:04,789 INFO L478 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 [2018-12-08 11:04:04,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 11:04:04,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:04,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:04,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-08 11:04:04,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:19 [2018-12-08 11:04:04,817 INFO L478 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 11 treesize of output 8 [2018-12-08 11:04:04,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 11:04:04,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-12-08 11:04:04,846 INFO L478 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 32 treesize of output 25 [2018-12-08 11:04:04,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:04,851 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-12-08 11:04:04,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:29 [2018-12-08 11:04:04,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:04,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:04,887 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:04:04,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-12-08 11:04:04,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:46 [2018-12-08 11:04:04,939 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-12-08 11:04:04,942 INFO L478 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 8 treesize of output 7 [2018-12-08 11:04:04,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:04,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-12-08 11:04:05,016 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-12-08 11:04:05,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:05,026 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:04:05,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:05,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:05,057 INFO L267 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. [2018-12-08 11:04:05,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:55 [2018-12-08 11:04:05,104 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:04:05,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2018-12-08 11:04:05,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:05,134 INFO L267 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. [2018-12-08 11:04:05,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:62 [2018-12-08 11:04:05,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:05,257 INFO L478 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 6 case distinctions, treesize of input 46 treesize of output 80 [2018-12-08 11:04:05,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2018-12-08 11:04:05,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:05,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:05,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 56 [2018-12-08 11:04:05,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 11:04:05,621 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-12-08 11:04:05,621 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:04:05,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-12-08 11:04:05,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-12-08 11:04:05,859 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:302 [2018-12-08 11:04:06,119 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2018-12-08 11:04:06,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2018-12-08 11:04:06,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:06,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-12-08 11:04:06,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:06,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:06,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 75 [2018-12-08 11:04:06,542 INFO L478 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 10 treesize of output 9 [2018-12-08 11:04:06,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:06,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:06,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 83 [2018-12-08 11:04:06,592 INFO L478 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 10 treesize of output 9 [2018-12-08 11:04:06,592 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:06,618 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:06,629 INFO L478 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 107 treesize of output 104 [2018-12-08 11:04:06,632 INFO L478 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 10 treesize of output 9 [2018-12-08 11:04:06,633 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:06,683 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:06,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:06,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:06,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:06,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 90 [2018-12-08 11:04:06,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:07,031 INFO L478 Elim1Store]: Elim1 applied some 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 3 case distinctions, treesize of input 33 treesize of output 52 [2018-12-08 11:04:07,031 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:04:07,071 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:07,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:07,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:07,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:07,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 131 [2018-12-08 11:04:07,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:07,311 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 146 [2018-12-08 11:04:07,312 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:04:07,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:07,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:07,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:07,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:07,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 119 [2018-12-08 11:04:07,598 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-08 11:04:07,763 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 11:04:07,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-08 11:04:07,907 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:276, output treesize:302 [2018-12-08 11:04:08,091 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-08 11:04:08,290 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-12-08 11:04:08,478 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-08 11:04:08,686 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-08 11:04:08,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 87 treesize of output 83 [2018-12-08 11:04:08,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:04:08,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:08,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:08,893 INFO L478 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 92 treesize of output 88 [2018-12-08 11:04:08,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:04:08,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:08,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:09,062 INFO L478 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 123 treesize of output 119 [2018-12-08 11:04:09,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 11:04:09,065 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:09,092 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:04:09,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-12-08 11:04:09,191 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:303, output treesize:270 [2018-12-08 11:04:09,794 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2018-12-08 11:04:09,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:09,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:09,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 104 [2018-12-08 11:04:09,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 87 [2018-12-08 11:04:09,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:09,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 67 [2018-12-08 11:04:09,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 11:04:09,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 79 [2018-12-08 11:04:09,978 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 11:04:10,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2018-12-08 11:04:10,176 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:10,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 55 [2018-12-08 11:04:10,330 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:10,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2018-12-08 11:04:10,332 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:10,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-12-08 11:04:10,335 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 11:04:10,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-12-08 11:04:10,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:10,583 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:04:10,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 72 [2018-12-08 11:04:10,609 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 40 [2018-12-08 11:04:10,610 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-08 11:04:10,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-12-08 11:04:10,637 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:04:10,648 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:04:10,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-12-08 11:04:10,781 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:218, output treesize:221 [2018-12-08 11:04:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:04:10,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 11:04:12,189 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-08 11:04:12,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:04:12,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:04:12,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:04:12,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:04:12,241 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:04:12,261 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:04:12,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 11:04:12,368 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:70, output treesize:187 [2018-12-08 11:04:16,997 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 70 [2018-12-08 11:04:23,158 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 80 [2018-12-08 11:04:33,992 WARN L180 SmtUtils]: Spent 6.10 s on a formula simplification that was a NOOP. DAG size: 94 [2018-12-08 11:04:43,002 WARN L180 SmtUtils]: Spent 8.22 s on a formula simplification that was a NOOP. DAG size: 94 [2018-12-08 11:05:10,776 WARN L180 SmtUtils]: Spent 12.21 s on a formula simplification that was a NOOP. DAG size: 103 [2018-12-08 11:05:12,093 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 170 DAG size of output: 110 [2018-12-08 11:05:12,110 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 101 [2018-12-08 11:05:12,182 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2018-12-08 11:05:12,186 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,189 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-12-08 11:05:12,189 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:12,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:12,219 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-12-08 11:05:12,223 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,225 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-08 11:05:12,226 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:12,241 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:12,244 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 81 [2018-12-08 11:05:12,249 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,253 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 77 [2018-12-08 11:05:12,254 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:12,288 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:12,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 61 treesize of output 53 [2018-12-08 11:05:12,372 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,373 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,377 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 70 [2018-12-08 11:05:12,495 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2018-12-08 11:05:12,499 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,499 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,501 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 42 [2018-12-08 11:05:12,508 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-08 11:05:12,568 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,569 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:12,570 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-12-08 11:05:12,570 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:12,600 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:05:12,625 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:05:12,629 INFO L478 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 76 treesize of output 68 [2018-12-08 11:05:12,633 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 81 [2018-12-08 11:05:12,692 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:12,698 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 88 [2018-12-08 11:05:13,010 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 11:05:13,010 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:13,115 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,116 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,116 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,117 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,117 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,117 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:13,121 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,202 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 120 [2018-12-08 11:05:13,373 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-12-08 11:05:13,384 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,385 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,385 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,386 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,403 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-12-08 11:05:13,408 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:13,434 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:13,516 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,516 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,516 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:13,518 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 102 [2018-12-08 11:05:13,601 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,602 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,603 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,603 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,603 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:13,605 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2018-12-08 11:05:13,606 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:13,632 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:13,722 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,725 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,728 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,732 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,740 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:13,744 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:13,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 62 treesize of output 104 [2018-12-08 11:05:14,247 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 80 [2018-12-08 11:05:14,251 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,251 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,252 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,252 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,252 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,252 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-12-08 11:05:14,260 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:14,364 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,364 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,366 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,367 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,367 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,370 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,370 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2018-12-08 11:05:14,372 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:14,464 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,464 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,468 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,472 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,473 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,480 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,484 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:14,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 88 [2018-12-08 11:05:14,518 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 16 xjuncts. [2018-12-08 11:05:14,681 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 11:05:14,779 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 11:05:15,055 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,058 INFO L478 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 56 treesize of output 61 [2018-12-08 11:05:15,064 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,064 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,069 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,089 INFO L478 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 76 [2018-12-08 11:05:15,261 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-12-08 11:05:15,266 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,267 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,270 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,278 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 70 [2018-12-08 11:05:15,290 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-12-08 11:05:15,413 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,413 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,414 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,416 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,417 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2018-12-08 11:05:15,418 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:15,449 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:15,467 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:15,606 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,606 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:15,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:15,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2018-12-08 11:05:15,616 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,616 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,616 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,616 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:15,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 72 [2018-12-08 11:05:15,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-12-08 11:05:15,680 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:15,696 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:15,715 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:15,931 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:05:16,028 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:05:16,033 INFO L478 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 99 treesize of output 89 [2018-12-08 11:05:16,038 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,040 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,044 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,055 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,060 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 141 [2018-12-08 11:05:16,575 WARN L180 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 111 [2018-12-08 11:05:16,580 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,580 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,581 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 89 [2018-12-08 11:05:16,596 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,596 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,597 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,597 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,598 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,606 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 86 [2018-12-08 11:05:16,769 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-12-08 11:05:16,773 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,778 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2018-12-08 11:05:16,779 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:16,847 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,847 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,848 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,854 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,860 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:16,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 68 [2018-12-08 11:05:16,876 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-12-08 11:05:16,959 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 11:05:17,002 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:17,147 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:17,148 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:17,148 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:17,149 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:17,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2018-12-08 11:05:17,155 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:17,280 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:17,281 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:17,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 101 [2018-12-08 11:05:17,496 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:17,498 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:17,501 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:17,504 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:17,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:17,511 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:17,514 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:17,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 85 treesize of output 117 [2018-12-08 11:05:18,085 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 79 [2018-12-08 11:05:18,089 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,090 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,090 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,094 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-08 11:05:18,096 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:18,211 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,211 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,215 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,219 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,219 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,226 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,229 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 88 [2018-12-08 11:05:18,268 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 16 xjuncts. [2018-12-08 11:05:18,538 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,539 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,539 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,541 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,541 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,542 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,543 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,551 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:18,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-12-08 11:05:18,561 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:18,803 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:05:19,028 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,029 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,029 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,029 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,030 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,030 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:19,034 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,103 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 133 [2018-12-08 11:05:19,308 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2018-12-08 11:05:19,330 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,330 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,331 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,331 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,349 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-12-08 11:05:19,353 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:19,384 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:19,615 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,615 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,616 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:19,617 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 102 [2018-12-08 11:05:19,719 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2018-12-08 11:05:19,722 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,722 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,723 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,723 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,723 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:19,725 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:19,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 56 [2018-12-08 11:05:19,726 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:19,746 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:19,822 INFO L267 ElimStorePlain]: Start of recursive call 39: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 11:05:20,010 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,010 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,010 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,013 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-12-08 11:05:20,016 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:20,194 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,194 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,195 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,195 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2018-12-08 11:05:20,202 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:20,367 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 83 [2018-12-08 11:05:20,473 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,478 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:20,483 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 98 [2018-12-08 11:05:20,861 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2018-12-08 11:05:20,865 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,865 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,866 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,869 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 63 [2018-12-08 11:05:20,872 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:05:20,975 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,975 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,976 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,976 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,977 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,977 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,978 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,982 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:20,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 76 [2018-12-08 11:05:20,986 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:05:21,093 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:21,097 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:21,097 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:21,097 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:21,101 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:21,108 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:21,110 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:21,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 97 [2018-12-08 11:05:21,148 INFO L267 ElimStorePlain]: Start of recursive call 54: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 12 xjuncts. [2018-12-08 11:05:21,510 INFO L267 ElimStorePlain]: Start of recursive call 51: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 11:05:21,877 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:21,878 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:21,878 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:21,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:21,880 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:21,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 97 [2018-12-08 11:05:22,042 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2018-12-08 11:05:22,045 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:22,046 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:22,046 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:22,046 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:22,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2018-12-08 11:05:22,047 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:22,070 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:22,371 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 11:05:22,531 INFO L267 ElimStorePlain]: Start of recursive call 33: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:05:22,643 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:05:22,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 11:05:23,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 145 [2018-12-08 11:05:24,151 WARN L180 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 127 [2018-12-08 11:05:24,156 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 95 [2018-12-08 11:05:24,160 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:24,163 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-08 11:05:24,163 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:24,202 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:24,206 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 114 [2018-12-08 11:05:24,211 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:24,213 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-08 11:05:24,214 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:24,257 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:24,260 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 86 [2018-12-08 11:05:24,264 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:24,267 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-08 11:05:24,268 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:24,303 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:24,761 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 104 [2018-12-08 11:05:24,771 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:24,775 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-12-08 11:05:24,775 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:24,825 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:25,232 INFO L478 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 93 treesize of output 83 [2018-12-08 11:05:25,237 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-12-08 11:05:25,241 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,244 INFO L478 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 33 treesize of output 41 [2018-12-08 11:05:25,249 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,256 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,287 INFO L478 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 59 [2018-12-08 11:05:25,491 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2018-12-08 11:05:25,495 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,497 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-12-08 11:05:25,497 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:25,501 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,502 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,502 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,508 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-12-08 11:05:25,509 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:05:25,516 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,516 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,520 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 51 [2018-12-08 11:05:25,528 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:05:25,794 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,794 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-12-08 11:05:25,795 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:25,801 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,801 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,803 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,804 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2018-12-08 11:05:25,809 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:05:25,966 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,967 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,970 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2018-12-08 11:05:25,977 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 2 xjuncts. [2018-12-08 11:05:25,982 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,985 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,991 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:25,996 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:26,001 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:26,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 62 [2018-12-08 11:05:26,023 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-12-08 11:05:26,222 INFO L267 ElimStorePlain]: Start of recursive call 69: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 11:05:26,371 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 11:05:26,518 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 11:05:26,743 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:26,745 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 23 [2018-12-08 11:05:26,746 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:26,917 INFO L267 ElimStorePlain]: Start of recursive call 66: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 11:05:26,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2018-12-08 11:05:26,930 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:26,933 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 23 [2018-12-08 11:05:26,933 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:26,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 25 [2018-12-08 11:05:26,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 11:05:26,989 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:26,994 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:26,994 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:26,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-12-08 11:05:26,995 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:05:27,018 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 11:05:27,066 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 11:05:27,928 INFO L478 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 89 treesize of output 79 [2018-12-08 11:05:27,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-12-08 11:05:27,957 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:27,960 INFO L478 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 33 treesize of output 41 [2018-12-08 11:05:27,964 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:27,972 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,001 INFO L478 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 59 [2018-12-08 11:05:28,217 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2018-12-08 11:05:28,221 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,222 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,222 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,227 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-12-08 11:05:28,228 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:05:28,233 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,233 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,237 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 53 [2018-12-08 11:05:28,244 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:05:28,248 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,251 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-12-08 11:05:28,251 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:28,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,487 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2018-12-08 11:05:28,494 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 2 xjuncts. [2018-12-08 11:05:28,498 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,501 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,508 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,513 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,518 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 62 [2018-12-08 11:05:28,544 INFO L267 ElimStorePlain]: Start of recursive call 91: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 7 xjuncts. [2018-12-08 11:05:28,842 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,843 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,846 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,846 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2018-12-08 11:05:28,855 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:05:28,858 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,859 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:28,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 11:05:28,860 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:29,050 INFO L267 ElimStorePlain]: Start of recursive call 86: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 11:05:29,218 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 11:05:29,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-08 11:05:29,401 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:29,571 INFO L267 ElimStorePlain]: Start of recursive call 84: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 11:05:29,777 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-12-08 11:05:29,799 INFO L478 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 113 treesize of output 106 [2018-12-08 11:05:29,805 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:29,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:29,897 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 103 [2018-12-08 11:05:29,908 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:29,908 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:29,909 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:29,921 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 103 [2018-12-08 11:05:29,929 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:29,930 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:29,933 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:29,934 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:29,946 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:29,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 88 [2018-12-08 11:05:30,267 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2018-12-08 11:05:30,270 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 11:05:30,270 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:30,280 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:30,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 64 [2018-12-08 11:05:30,320 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 4 xjuncts. [2018-12-08 11:05:30,321 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 11:05:30,322 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:30,610 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:30,619 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:30,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 39 [2018-12-08 11:05:30,626 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 2 xjuncts. [2018-12-08 11:05:30,731 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:30,737 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:30,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 43 [2018-12-08 11:05:30,749 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 2 xjuncts. [2018-12-08 11:05:30,799 INFO L267 ElimStorePlain]: Start of recursive call 98: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:30,844 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:30,968 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:30,968 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:30,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:30,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:30,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 99 [2018-12-08 11:05:30,981 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:30,981 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:30,984 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 65 [2018-12-08 11:05:31,131 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-12-08 11:05:31,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2018-12-08 11:05:31,135 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:31,137 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 11:05:31,137 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:31,138 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 11:05:31,138 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:31,192 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,192 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,193 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,193 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-12-08 11:05:31,194 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:31,209 INFO L267 ElimStorePlain]: Start of recursive call 105: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:31,231 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:31,343 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2018-12-08 11:05:31,352 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2018-12-08 11:05:31,387 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-12-08 11:05:31,388 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:31,388 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-08 11:05:31,388 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:31,394 INFO L267 ElimStorePlain]: Start of recursive call 111: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:31,404 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:31,666 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,668 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-12-08 11:05:31,669 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:31,778 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,779 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 115 [2018-12-08 11:05:31,963 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,964 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,964 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,965 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,965 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:31,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:32,032 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 158 [2018-12-08 11:05:32,414 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-12-08 11:05:32,418 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,418 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,419 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,424 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2018-12-08 11:05:32,426 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:32,519 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,520 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,520 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,521 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,524 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,605 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,615 INFO L303 Elim1Store]: Index analysis took 106 ms [2018-12-08 11:05:32,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 102 [2018-12-08 11:05:32,625 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 2 xjuncts. [2018-12-08 11:05:32,690 INFO L267 ElimStorePlain]: Start of recursive call 116: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:32,831 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,831 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:32,835 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:32,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 116 [2018-12-08 11:05:33,080 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2018-12-08 11:05:33,084 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:33,084 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:33,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2018-12-08 11:05:33,085 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:33,191 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:33,192 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:33,192 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:33,193 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:33,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 81 [2018-12-08 11:05:33,194 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:33,240 INFO L267 ElimStorePlain]: Start of recursive call 119: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:33,379 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:33,399 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:33,399 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:33,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:33,502 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:33,505 INFO L303 Elim1Store]: Index analysis took 161 ms [2018-12-08 11:05:33,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 89 treesize of output 157 [2018-12-08 11:05:34,929 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 182 DAG size of output: 148 [2018-12-08 11:05:34,931 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 11:05:34,931 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:34,933 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 11:05:34,933 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:34,948 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:34,960 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:35,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 145 [2018-12-08 11:05:35,015 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 11:05:35,017 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 32 xjuncts. [2018-12-08 11:05:36,342 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:36,343 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:36,346 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:36,347 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:36,347 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:36,350 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:36,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 96 [2018-12-08 11:05:36,366 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 2 xjuncts. [2018-12-08 11:05:36,938 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:36,944 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:36,955 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:36,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 124 [2018-12-08 11:05:36,989 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 16 xjuncts. [2018-12-08 11:05:37,454 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:37,455 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:37,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:05:37,456 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:37,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 112 [2018-12-08 11:05:37,457 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:37,814 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:37,815 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:37,815 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:37,816 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:37,818 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:37,820 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:37,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-12-08 11:05:37,825 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:38,045 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:38,046 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:38,046 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:38,049 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:38,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2018-12-08 11:05:38,051 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:38,158 INFO L267 ElimStorePlain]: Start of recursive call 122: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 11:05:38,316 INFO L267 ElimStorePlain]: Start of recursive call 115: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 11:05:38,397 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:38,399 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2018-12-08 11:05:38,400 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:38,408 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:38,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2018-12-08 11:05:38,410 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:38,463 INFO L267 ElimStorePlain]: Start of recursive call 96: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:05:38,554 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-08 11:05:38,576 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:38,577 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:38,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-12-08 11:05:38,578 INFO L267 ElimStorePlain]: Start of recursive call 134: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:05:38,579 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 11:05:38,580 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:38,597 INFO L267 ElimStorePlain]: Start of recursive call 133: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:05:38,684 INFO L267 ElimStorePlain]: Start of recursive call 95: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-08 11:05:38,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 83 treesize of output 73 [2018-12-08 11:05:38,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 25 [2018-12-08 11:05:38,722 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:38,723 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:38,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-12-08 11:05:38,724 INFO L267 ElimStorePlain]: Start of recursive call 138: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:05:38,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 11:05:38,728 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:38,749 INFO L267 ElimStorePlain]: Start of recursive call 137: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 11:05:38,803 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-12-08 11:05:38,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-08 11:05:38,814 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:38,818 INFO L267 ElimStorePlain]: Start of recursive call 140: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:38,867 INFO L267 ElimStorePlain]: Start of recursive call 136: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 11:05:40,082 INFO L478 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 99 treesize of output 89 [2018-12-08 11:05:40,087 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:40,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 71 [2018-12-08 11:05:40,401 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 [2018-12-08 11:05:40,407 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:40,409 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-12-08 11:05:40,410 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:40,534 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:40,538 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-08 11:05:40,538 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:40,646 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:40,648 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:40,648 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:40,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2018-12-08 11:05:40,653 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:40,661 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:40,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2018-12-08 11:05:40,666 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:40,735 INFO L267 ElimStorePlain]: Start of recursive call 143: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:05:40,828 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-08 11:05:40,847 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 11:05:40,848 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:40,852 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:40,852 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:40,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 11:05:40,853 INFO L267 ElimStorePlain]: Start of recursive call 150: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:05:40,872 INFO L267 ElimStorePlain]: Start of recursive call 148: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:05:40,951 INFO L267 ElimStorePlain]: Start of recursive call 142: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-12-08 11:05:42,191 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 22 dim-0 vars, and 26 xjuncts. [2018-12-08 11:05:45,221 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 90 [2018-12-08 11:05:45,295 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-12-08 11:05:45,299 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:45,301 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-12-08 11:05:45,302 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:45,316 INFO L267 ElimStorePlain]: Start of recursive call 152: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:45,321 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-12-08 11:05:45,326 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:45,331 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-12-08 11:05:45,331 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:45,357 INFO L267 ElimStorePlain]: Start of recursive call 154: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:45,362 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 71 [2018-12-08 11:05:45,366 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:45,371 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 67 [2018-12-08 11:05:45,371 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:45,399 INFO L267 ElimStorePlain]: Start of recursive call 156: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:45,483 INFO L478 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 83 treesize of output 73 [2018-12-08 11:05:45,488 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:45,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 84 [2018-12-08 11:05:45,800 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2018-12-08 11:05:45,804 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:45,808 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2018-12-08 11:05:45,808 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:45,938 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:45,940 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-12-08 11:05:45,940 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:46,044 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:46,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 31 [2018-12-08 11:05:46,051 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:46,057 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:46,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 37 [2018-12-08 11:05:46,064 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:46,131 INFO L267 ElimStorePlain]: Start of recursive call 159: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:05:46,203 INFO L267 ElimStorePlain]: Start of recursive call 158: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:05:46,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 49 treesize of output 41 [2018-12-08 11:05:46,209 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:46,211 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 23 [2018-12-08 11:05:46,211 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:46,220 INFO L267 ElimStorePlain]: Start of recursive call 164: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:05:46,224 INFO L478 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 66 treesize of output 58 [2018-12-08 11:05:46,228 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:46,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 71 [2018-12-08 11:05:46,615 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2018-12-08 11:05:46,618 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:46,621 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2018-12-08 11:05:46,622 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:46,740 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:46,742 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-12-08 11:05:46,742 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:46,835 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:46,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2018-12-08 11:05:46,843 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:46,847 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:46,847 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:46,848 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:05:46,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2018-12-08 11:05:46,852 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2018-12-08 11:05:46,912 INFO L267 ElimStorePlain]: Start of recursive call 167: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:05:46,975 INFO L267 ElimStorePlain]: Start of recursive call 166: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 11:05:47,068 INFO L267 ElimStorePlain]: Start of recursive call 151: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-08 11:05:49,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 3 dim-2 vars, End of recursive call: 68 dim-0 vars, and 37 xjuncts. [2018-12-08 11:05:49,428 INFO L202 ElimStorePlain]: Needed 171 recursive calls to eliminate 17 variables, input treesize:420, output treesize:1365 [2018-12-08 11:05:50,663 WARN L180 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 530 DAG size of output: 36 [2018-12-08 11:05:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:05:52,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 11:05:52,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 38 [2018-12-08 11:05:52,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-08 11:05:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-08 11:05:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1312, Unknown=7, NotChecked=0, Total=1482 [2018-12-08 11:05:52,302 INFO L87 Difference]: Start difference. First operand 354 states and 375 transitions. Second operand 39 states. [2018-12-08 11:05:58,247 WARN L180 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 163 DAG size of output: 74 [2018-12-08 11:06:06,279 WARN L180 SmtUtils]: Spent 4.57 s on a formula simplification. DAG size of input: 184 DAG size of output: 102 [2018-12-08 11:06:10,860 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2018-12-08 11:06:20,019 WARN L180 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 249 DAG size of output: 151 [2018-12-08 11:06:21,216 WARN L180 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 111 [2018-12-08 11:06:21,988 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2018-12-08 11:06:23,165 WARN L180 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 111 [2018-12-08 11:06:26,097 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 138 DAG size of output: 122 [2018-12-08 11:06:28,554 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 197 DAG size of output: 185 [2018-12-08 11:06:29,673 WARN L180 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 147 [2018-12-08 11:06:30,878 WARN L180 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 152 [2018-12-08 11:06:31,852 WARN L180 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 122 [2018-12-08 11:06:34,121 WARN L180 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 126 [2018-12-08 11:06:39,919 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-08 11:06:43,132 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2018-12-08 11:06:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 11:06:54,277 INFO L93 Difference]: Finished difference Result 392 states and 415 transitions. [2018-12-08 11:06:54,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 11:06:54,278 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 58 [2018-12-08 11:06:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 11:06:54,279 INFO L225 Difference]: With dead ends: 392 [2018-12-08 11:06:54,279 INFO L226 Difference]: Without dead ends: 392 [2018-12-08 11:06:54,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 95.8s TimeCoverageRelationStatistics Valid=463, Invalid=2833, Unknown=10, NotChecked=0, Total=3306 [2018-12-08 11:06:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-12-08 11:06:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 355. [2018-12-08 11:06:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-12-08 11:06:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 377 transitions. [2018-12-08 11:06:54,284 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 377 transitions. Word has length 58 [2018-12-08 11:06:54,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 11:06:54,285 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 377 transitions. [2018-12-08 11:06:54,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-08 11:06:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 377 transitions. [2018-12-08 11:06:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 11:06:54,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 11:06:54,285 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 11:06:54,286 INFO L423 AbstractCegarLoop]: === Iteration 27 === [merge_pairErr21REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr18ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION]=== [2018-12-08 11:06:54,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 11:06:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1329572276, now seen corresponding path program 1 times [2018-12-08 11:06:54,286 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 11:06:54,286 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3de7d778-9d7c-4c50-a6f1-5a17e6f2ea71/bin-2019/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:06:54,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 11:06:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 11:06:54,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 11:06:54,538 INFO L478 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 [2018-12-08 11:06:54,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,546 INFO L478 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 [2018-12-08 11:06:54,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 11:06:54,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:54,564 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-08 11:06:54,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:54,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:54,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-08 11:06:54,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-12-08 11:06:54,622 INFO L478 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 11 treesize of output 8 [2018-12-08 11:06:54,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-12-08 11:06:54,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,650 INFO L478 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 11 treesize of output 8 [2018-12-08 11:06:54,653 INFO L478 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 8 treesize of output 7 [2018-12-08 11:06:54,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:54 [2018-12-08 11:06:54,699 INFO L478 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 43 treesize of output 34 [2018-12-08 11:06:54,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:54,707 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-12-08 11:06:54,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,764 INFO L478 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 21 treesize of output 16 [2018-12-08 11:06:54,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:54,773 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-08 11:06:54,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:54 [2018-12-08 11:06:54,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:54,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:54,841 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2018-12-08 11:06:54,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:54,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:54,877 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:06:54,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-12-08 11:06:54,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:72 [2018-12-08 11:06:54,964 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 11:06:54,969 INFO L478 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 8 treesize of output 7 [2018-12-08 11:06:54,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:54,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,027 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-12-08 11:06:55,031 INFO L478 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 8 treesize of output 7 [2018-12-08 11:06:55,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:90 [2018-12-08 11:06:55,150 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-12-08 11:06:55,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:55,159 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:06:55,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,253 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 62 [2018-12-08 11:06:55,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:55,262 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 11:06:55,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,306 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:90 [2018-12-08 11:06:55,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:55,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:55,318 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 11:06:55,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 37 [2018-12-08 11:06:55,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 63 [2018-12-08 11:06:55,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:94 [2018-12-08 11:06:55,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:55,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2018-12-08 11:06:55,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-12-08 11:06:55,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:55,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-12-08 11:06:55,639 INFO L478 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 8 treesize of output 7 [2018-12-08 11:06:55,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,709 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:118, output treesize:124 [2018-12-08 11:06:55,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:55,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64 [2018-12-08 11:06:55,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:55,823 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-12-08 11:06:55,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:55,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:55,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:55,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:55,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 117 [2018-12-08 11:06:55,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:56,007 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 114 [2018-12-08 11:06:56,008 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 11:06:56,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:56,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 11:06:56,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:178 [2018-12-08 11:06:56,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:56,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2018-12-08 11:06:56,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 11:06:56,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:56,933 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-08 11:06:56,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:56,956 INFO L478 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 52 treesize of output 39 [2018-12-08 11:06:56,957 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:06:56,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:06:57,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:57,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:57,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 99 [2018-12-08 11:06:57,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 11:06:57,024 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:57,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 11:06:57,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-12-08 11:06:57,058 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 11:06:57,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2018-12-08 11:06:57,085 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 11:06:57,107 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 11:06:57,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 11:06:57,131 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:204, output treesize:56 [2018-12-08 11:06:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 11:06:57,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 11:07:02,875 WARN L180 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 166 DAG size of output: 155 [2018-12-08 11:07:02,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:02,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:02,922 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:02,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:02,976 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:03,026 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:04,418 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:04,445 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:04,445 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:04,486 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:04,487 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:04,513 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:05,661 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:05,720 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:05,720 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:05,772 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:06,963 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:07,008 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:07,009 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:07,051 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:08,178 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:08,225 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:08,226 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:08,265 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:09,369 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:09,411 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:09,411 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:09,445 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 11:07:10,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 18 dim-0 vars, and 7 xjuncts. [2018-12-08 11:07:10,539 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 9 variables, input treesize:307, output treesize:487 [2018-12-08 11:07:31,116 WARN L180 SmtUtils]: Spent 18.44 s on a formula simplification. DAG size of input: 188 DAG size of output: 160 [2018-12-08 11:07:55,761 WARN L180 SmtUtils]: Spent 15.05 s on a formula simplification that was a NOOP. DAG size: 182 [2018-12-08 11:08:27,019 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-08 11:08:27,220 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 11:08:27,221 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) 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.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) 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.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 46 more [2018-12-08 11:08:27,229 INFO L168 Benchmark]: Toolchain (without parser) took 306770.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -101.9 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. [2018-12-08 11:08:27,229 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 11:08:27,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-12-08 11:08:27,230 INFO L168 Benchmark]: Boogie Preprocessor took 43.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-08 11:08:27,230 INFO L168 Benchmark]: RCFGBuilder took 751.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.4 MB). Peak memory consumption was 101.4 MB. Max. memory is 11.5 GB. [2018-12-08 11:08:27,230 INFO L168 Benchmark]: TraceAbstraction took 305635.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -16.0 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2018-12-08 11:08:27,231 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 751.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.4 MB). Peak memory consumption was 101.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 305635.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -16.0 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...