./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all_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_58978d5f-c5a6-43f1-873e-c60a089439d7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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 d9cd680588366d8f4117005099c5fa975e5f03ed .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 06:06:52,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:06:52,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:06:52,663 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:06:52,663 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:06:52,664 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:06:52,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:06:52,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:06:52,666 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:06:52,666 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:06:52,667 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:06:52,667 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:06:52,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:06:52,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:06:52,668 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:06:52,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:06:52,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:06:52,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:06:52,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:06:52,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:06:52,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:06:52,672 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:06:52,673 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:06:52,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:06:52,674 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:06:52,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:06:52,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:06:52,675 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:06:52,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:06:52,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:06:52,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:06:52,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:06:52,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:06:52,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:06:52,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:06:52,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:06:52,677 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 06:06:52,684 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:06:52,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:06:52,685 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 06:06:52,685 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 06:06:52,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 06:06:52,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 06:06:52,685 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 06:06:52,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:06:52,686 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:06:52,686 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 06:06:52,686 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:06:52,686 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:06:52,686 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:06:52,686 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 06:06:52,686 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 06:06:52,686 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 06:06:52,686 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 06:06:52,686 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:06:52,687 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 06:06:52,687 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:06:52,687 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:06:52,687 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 06:06:52,687 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 06:06:52,687 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 06:06:52,687 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:06:52,687 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 06:06:52,687 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 06:06:52,687 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 06:06:52,687 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_58978d5f-c5a6-43f1-873e-c60a089439d7/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 -> d9cd680588366d8f4117005099c5fa975e5f03ed [2018-12-02 06:06:52,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:06:52,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:06:52,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:06:52,716 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:06:52,717 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:06:52,717 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 06:06:52,752 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/bin-2019/uautomizer/data/666eec59d/ae18f1bc7372479bb082c500787af10c/FLAG9293f9cbc [2018-12-02 06:06:53,129 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:06:53,129 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/sv-benchmarks/c/list-simple/dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 06:06:53,135 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/bin-2019/uautomizer/data/666eec59d/ae18f1bc7372479bb082c500787af10c/FLAG9293f9cbc [2018-12-02 06:06:53,488 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/bin-2019/uautomizer/data/666eec59d/ae18f1bc7372479bb082c500787af10c [2018-12-02 06:06:53,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:06:53,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 06:06:53,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:06:53,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:06:53,493 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:06:53,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:06:53" (1/1) ... [2018-12-02 06:06:53,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42914834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:06:53, skipping insertion in model container [2018-12-02 06:06:53,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:06:53" (1/1) ... [2018-12-02 06:06:53,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:06:53,520 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:06:53,667 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:06:53,673 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:06:53,740 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:06:53,760 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:06:53,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:06:53 WrapperNode [2018-12-02 06:06:53,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:06:53,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:06:53,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:06:53,761 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:06:53,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:06:53" (1/1) ... [2018-12-02 06:06:53,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:06:53" (1/1) ... [2018-12-02 06:06:53,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:06:53" (1/1) ... [2018-12-02 06:06:53,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:06:53" (1/1) ... [2018-12-02 06:06:53,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:06:53" (1/1) ... [2018-12-02 06:06:53,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:06:53" (1/1) ... [2018-12-02 06:06:53,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:06:53" (1/1) ... [2018-12-02 06:06:53,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:06:53,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:06:53,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:06:53,791 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:06:53,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:06:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:06:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 06:06:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:06:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 06:06:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 06:06:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 06:06:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 06:06:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-02 06:06:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2018-12-02 06:06:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 06:06:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-12-02 06:06:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 06:06:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 06:06:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 06:06:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 06:06:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 06:06:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 06:06:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 06:06:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 06:06:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 06:06:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 06:06:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 06:06:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 06:06:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 06:06:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 06:06:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 06:06:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 06:06:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 06:06:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 06:06:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 06:06:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-02 06:06:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2018-12-02 06:06:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 06:06:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 06:06:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 06:06:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 06:06:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 06:06:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:06:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 06:06:54,073 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:06:54,073 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 06:06:54,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:06:54 BoogieIcfgContainer [2018-12-02 06:06:54,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:06:54,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 06:06:54,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 06:06:54,076 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 06:06:54,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:06:53" (1/3) ... [2018-12-02 06:06:54,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f6c0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:06:54, skipping insertion in model container [2018-12-02 06:06:54,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:06:53" (2/3) ... [2018-12-02 06:06:54,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f6c0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:06:54, skipping insertion in model container [2018-12-02 06:06:54,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:06:54" (3/3) ... [2018-12-02 06:06:54,078 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 06:06:54,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 06:06:54,089 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-12-02 06:06:54,097 INFO L257 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2018-12-02 06:06:54,112 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 06:06:54,112 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 06:06:54,112 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 06:06:54,112 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 06:06:54,112 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:06:54,112 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:06:54,112 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 06:06:54,112 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:06:54,113 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 06:06:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-12-02 06:06:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 06:06:54,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:06:54,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:06:54,129 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:06:54,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:06:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1767081539, now seen corresponding path program 1 times [2018-12-02 06:06:54,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:06:54,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:06:54,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:54,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:54,227 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-02 06:06:54,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:06:54,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 06:06:54,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:06:54,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:06:54,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:06:54,239 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2018-12-02 06:06:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:06:54,296 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-12-02 06:06:54,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:06:54,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 06:06:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:06:54,304 INFO L225 Difference]: With dead ends: 69 [2018-12-02 06:06:54,304 INFO L226 Difference]: Without dead ends: 62 [2018-12-02 06:06:54,306 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-02 06:06:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-02 06:06:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-12-02 06:06:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 06:06:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-12-02 06:06:54,328 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 11 [2018-12-02 06:06:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:06:54,328 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-12-02 06:06:54,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:06:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-12-02 06:06:54,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 06:06:54,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:06:54,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:06:54,329 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:06:54,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:06:54,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1767081540, now seen corresponding path program 1 times [2018-12-02 06:06:54,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:06:54,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:06:54,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:54,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:54,367 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-02 06:06:54,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:06:54,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 06:06:54,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:06:54,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:06:54,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:06:54,369 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 3 states. [2018-12-02 06:06:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:06:54,407 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-12-02 06:06:54,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:06:54,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 06:06:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:06:54,408 INFO L225 Difference]: With dead ends: 59 [2018-12-02 06:06:54,408 INFO L226 Difference]: Without dead ends: 59 [2018-12-02 06:06:54,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:06:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-02 06:06:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-12-02 06:06:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 06:06:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-12-02 06:06:54,413 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 11 [2018-12-02 06:06:54,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:06:54,413 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-12-02 06:06:54,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:06:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-12-02 06:06:54,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 06:06:54,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:06:54,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:06:54,414 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:06:54,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:06:54,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1402216098, now seen corresponding path program 1 times [2018-12-02 06:06:54,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:06:54,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:06:54,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:54,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:54,445 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-02 06:06:54,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:06:54,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:06:54,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 06:06:54,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 06:06:54,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 06:06:54,446 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-12-02 06:06:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:06:54,464 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-12-02 06:06:54,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:06:54,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-02 06:06:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:06:54,466 INFO L225 Difference]: With dead ends: 58 [2018-12-02 06:06:54,466 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 06:06:54,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:06:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 06:06:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-12-02 06:06:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 06:06:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-12-02 06:06:54,474 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 15 [2018-12-02 06:06:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:06:54,474 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-12-02 06:06:54,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 06:06:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-12-02 06:06:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 06:06:54,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:06:54,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:06:54,475 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:06:54,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:06:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash -336303097, now seen corresponding path program 1 times [2018-12-02 06:06:54,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:06:54,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:06:54,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:54,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:54,504 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-02 06:06:54,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:06:54,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:06:54,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 06:06:54,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:06:54,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:06:54,505 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 3 states. [2018-12-02 06:06:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:06:54,519 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-12-02 06:06:54,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 06:06:54,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-02 06:06:54,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:06:54,520 INFO L225 Difference]: With dead ends: 66 [2018-12-02 06:06:54,520 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 06:06:54,520 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-02 06:06:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 06:06:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-12-02 06:06:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-02 06:06:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-12-02 06:06:54,523 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2018-12-02 06:06:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:06:54,523 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-12-02 06:06:54,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 06:06:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-12-02 06:06:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 06:06:54,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:06:54,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:06:54,524 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:06:54,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:06:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1090178234, now seen corresponding path program 1 times [2018-12-02 06:06:54,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:06:54,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:06:54,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:54,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:54,572 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-02 06:06:54,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:06:54,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:06:54,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:06:54,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:06:54,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:06:54,573 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 6 states. [2018-12-02 06:06:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:06:54,671 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-12-02 06:06:54,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 06:06:54,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-02 06:06:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:06:54,672 INFO L225 Difference]: With dead ends: 84 [2018-12-02 06:06:54,672 INFO L226 Difference]: Without dead ends: 84 [2018-12-02 06:06:54,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:06:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-02 06:06:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2018-12-02 06:06:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 06:06:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-12-02 06:06:54,676 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 17 [2018-12-02 06:06:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:06:54,676 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-12-02 06:06:54,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:06:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-12-02 06:06:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 06:06:54,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:06:54,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:06:54,677 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:06:54,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:06:54,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1090178235, now seen corresponding path program 1 times [2018-12-02 06:06:54,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:06:54,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:06:54,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:54,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:54,701 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-02 06:06:54,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:06:54,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:06:54,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:06:54,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:06:54,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:06:54,702 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 5 states. [2018-12-02 06:06:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:06:54,719 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-12-02 06:06:54,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:06:54,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 06:06:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:06:54,720 INFO L225 Difference]: With dead ends: 65 [2018-12-02 06:06:54,720 INFO L226 Difference]: Without dead ends: 62 [2018-12-02 06:06:54,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02 06:06:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-02 06:06:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-12-02 06:06:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 06:06:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-12-02 06:06:54,723 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2018-12-02 06:06:54,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:06:54,723 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-12-02 06:06:54,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:06:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-12-02 06:06:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 06:06:54,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:06:54,724 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:06:54,724 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:06:54,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:06:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1878714113, now seen corresponding path program 1 times [2018-12-02 06:06:54,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:06:54,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:06:54,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:54,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:06:54,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:06:54,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:06:54,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:54,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:06:54,840 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-02 06:06:54,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:06:54,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:06:54,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 06:06:54,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:06:54,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:06:54,853 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-02 06:06:54,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:06:54,859 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-02 06:06:54,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-02 06:06:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:06:54,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:06:54,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-12-02 06:06:54,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:06:54,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:06:54,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:06:54,899 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 7 states. [2018-12-02 06:06:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:06:54,986 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-02 06:06:54,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:06:54,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-02 06:06:54,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:06:54,987 INFO L225 Difference]: With dead ends: 65 [2018-12-02 06:06:54,987 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 06:06:54,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:06:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 06:06:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-12-02 06:06:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 06:06:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-02 06:06:54,990 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 22 [2018-12-02 06:06:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:06:54,990 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-02 06:06:54,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:06:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-02 06:06:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 06:06:54,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:06:54,990 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:06:54,991 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:06:54,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:06:54,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1878714112, now seen corresponding path program 1 times [2018-12-02 06:06:54,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:06:54,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:06:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:54,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:06:55,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:06:55,052 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:06:55,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:55,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:06:55,082 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-02 06:06:55,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:06:55,095 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-02 06:06:55,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:06:55,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:06:55,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 06:06:55,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:06:55,139 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-02 06:06:55,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:06:55,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:06:55,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:06:55,149 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-02 06:06:55,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:06:55,155 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-02 06:06:55,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-02 06:06:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:06:55,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:06:55,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 7 [2018-12-02 06:06:55,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 06:06:55,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:06:55,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:06:55,193 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 8 states. [2018-12-02 06:06:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:06:55,348 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-12-02 06:06:55,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:06:55,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-02 06:06:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:06:55,349 INFO L225 Difference]: With dead ends: 64 [2018-12-02 06:06:55,349 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 06:06:55,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:06:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 06:06:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-12-02 06:06:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 06:06:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-12-02 06:06:55,352 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 22 [2018-12-02 06:06:55,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:06:55,352 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-12-02 06:06:55,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 06:06:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-12-02 06:06:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 06:06:55,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:06:55,352 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] [2018-12-02 06:06:55,353 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:06:55,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:06:55,353 INFO L82 PathProgramCache]: Analyzing trace with hash 596908978, now seen corresponding path program 1 times [2018-12-02 06:06:55,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:06:55,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:06:55,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:55,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:55,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:55,380 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-02 06:06:55,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:06:55,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:06:55,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:55,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:06:55,407 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-02 06:06:55,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:06:55,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 06:06:55,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:06:55,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:06:55,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:06:55,432 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 6 states. [2018-12-02 06:06:55,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:06:55,449 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-02 06:06:55,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:06:55,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-12-02 06:06:55,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:06:55,449 INFO L225 Difference]: With dead ends: 71 [2018-12-02 06:06:55,449 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 06:06:55,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:06:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 06:06:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-12-02 06:06:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 06:06:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-12-02 06:06:55,452 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 24 [2018-12-02 06:06:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:06:55,452 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-12-02 06:06:55,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:06:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-12-02 06:06:55,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 06:06:55,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:06:55,453 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:06:55,453 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:06:55,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:06:55,453 INFO L82 PathProgramCache]: Analyzing trace with hash 279610810, now seen corresponding path program 2 times [2018-12-02 06:06:55,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:06:55,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:06:55,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:55,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:55,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:06:55,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:06:55,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:06:55,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 06:06:55,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 06:06:55,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:06:55,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:06:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:06:55,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:06:55,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 6 [2018-12-02 06:06:55,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:06:55,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:06:55,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:06:55,556 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 6 states. [2018-12-02 06:06:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:06:55,589 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-12-02 06:06:55,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 06:06:55,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-02 06:06:55,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:06:55,590 INFO L225 Difference]: With dead ends: 61 [2018-12-02 06:06:55,590 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 06:06:55,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:06:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 06:06:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-02 06:06:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 06:06:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-02 06:06:55,592 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 31 [2018-12-02 06:06:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:06:55,592 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-02 06:06:55,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:06:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-02 06:06:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 06:06:55,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:06:55,593 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:06:55,593 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:06:55,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:06:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash 898443166, now seen corresponding path program 1 times [2018-12-02 06:06:55,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:06:55,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:06:55,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:55,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:06:55,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:06:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:06:55,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:06:55,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:06:55,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:06:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:06:55,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:06:55,753 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-02 06:06:55,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:06:55,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:06:55,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 06:06:56,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:06:56,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:06:56,120 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 20 treesize of output 27 [2018-12-02 06:06:56,124 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 23 treesize of output 20 [2018-12-02 06:06:56,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:06:56,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:06:56,132 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-02 06:06:56,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2018-12-02 06:06:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:06:56,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:06:56,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-12-02 06:06:56,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 06:06:56,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 06:06:56,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=188, Unknown=1, NotChecked=0, Total=240 [2018-12-02 06:06:56,188 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 16 states. [2018-12-02 06:06:59,079 WARN L180 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-02 06:07:00,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:00,448 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-12-02 06:07:00,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:07:00,448 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-12-02 06:07:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:00,448 INFO L225 Difference]: With dead ends: 92 [2018-12-02 06:07:00,448 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 06:07:00,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=99, Invalid=316, Unknown=5, NotChecked=0, Total=420 [2018-12-02 06:07:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 06:07:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-12-02 06:07:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 06:07:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-12-02 06:07:00,452 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 32 [2018-12-02 06:07:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:00,452 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-12-02 06:07:00,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 06:07:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-12-02 06:07:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 06:07:00,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:00,453 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:00,453 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:00,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:00,453 INFO L82 PathProgramCache]: Analyzing trace with hash 898443167, now seen corresponding path program 1 times [2018-12-02 06:07:00,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:00,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:00,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:00,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:00,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:00,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:07:00,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:07:00,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:00,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:07:00,608 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-02 06:07:00,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:00,613 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-02 06:07:00,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:00,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:00,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 06:07:00,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:00,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:00,686 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 06:07:00,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:00,689 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 23 treesize of output 34 [2018-12-02 06:07:00,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:00,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:00,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:00,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:00,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:00,708 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-02 06:07:00,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:00,715 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-02 06:07:00,715 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2018-12-02 06:07:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:00,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:07:00,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-12-02 06:07:00,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 06:07:00,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 06:07:00,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-12-02 06:07:00,774 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 15 states. [2018-12-02 06:07:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:03,702 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-12-02 06:07:03,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:07:03,702 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-12-02 06:07:03,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:03,703 INFO L225 Difference]: With dead ends: 103 [2018-12-02 06:07:03,703 INFO L226 Difference]: Without dead ends: 103 [2018-12-02 06:07:03,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=77, Invalid=301, Unknown=2, NotChecked=0, Total=380 [2018-12-02 06:07:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-02 06:07:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-12-02 06:07:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-02 06:07:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2018-12-02 06:07:03,705 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 32 [2018-12-02 06:07:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:03,706 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2018-12-02 06:07:03,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 06:07:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2018-12-02 06:07:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 06:07:03,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:03,706 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:03,706 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:03,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:03,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2081934351, now seen corresponding path program 1 times [2018-12-02 06:07:03,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:03,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:03,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:03,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:03,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 06:07:03,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:07:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:07:03,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 06:07:03,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 06:07:03,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:07:03,751 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand 10 states. [2018-12-02 06:07:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:03,900 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2018-12-02 06:07:03,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:07:03,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-12-02 06:07:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:03,901 INFO L225 Difference]: With dead ends: 118 [2018-12-02 06:07:03,901 INFO L226 Difference]: Without dead ends: 118 [2018-12-02 06:07:03,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:07:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-02 06:07:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2018-12-02 06:07:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 06:07:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2018-12-02 06:07:03,905 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 33 [2018-12-02 06:07:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:03,905 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2018-12-02 06:07:03,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 06:07:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2018-12-02 06:07:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 06:07:03,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:03,906 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:03,906 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:03,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:03,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2081934352, now seen corresponding path program 1 times [2018-12-02 06:07:03,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:03,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:03,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:03,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:03,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 06:07:03,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:07:03,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:07:03,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 06:07:03,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 06:07:03,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:07:03,993 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand 10 states. [2018-12-02 06:07:04,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:04,163 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2018-12-02 06:07:04,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 06:07:04,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-12-02 06:07:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:04,163 INFO L225 Difference]: With dead ends: 121 [2018-12-02 06:07:04,163 INFO L226 Difference]: Without dead ends: 121 [2018-12-02 06:07:04,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:07:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-02 06:07:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2018-12-02 06:07:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 06:07:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-12-02 06:07:04,166 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 33 [2018-12-02 06:07:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:04,166 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-12-02 06:07:04,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 06:07:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-12-02 06:07:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 06:07:04,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:04,167 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:04,167 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:04,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:04,167 INFO L82 PathProgramCache]: Analyzing trace with hash -716486686, now seen corresponding path program 1 times [2018-12-02 06:07:04,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:04,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:04,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:04,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:07:04,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:07:04,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:04,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:07:04,372 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-02 06:07:04,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 06:07:04,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:04,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:04,376 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-02 06:07:04,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-02 06:07:04,390 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-02 06:07:04,391 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-02 06:07:04,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-12-02 06:07:04,416 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-02 06:07:04,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:04,418 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 27 [2018-12-02 06:07:04,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-02 06:07:04,450 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 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-02 06:07:04,451 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 16 treesize of output 15 [2018-12-02 06:07:04,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,464 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-02 06:07:04,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-12-02 06:07:04,706 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 93 treesize of output 83 [2018-12-02 06:07:04,709 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 83 treesize of output 70 [2018-12-02 06:07:04,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,720 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-02 06:07:04,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:77 [2018-12-02 06:07:04,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 64 [2018-12-02 06:07:04,777 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 49 treesize of output 39 [2018-12-02 06:07:04,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,806 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 47 treesize of output 38 [2018-12-02 06:07:04,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,833 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 53 treesize of output 48 [2018-12-02 06:07:04,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:04,856 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 24 treesize of output 14 [2018-12-02 06:07:04,856 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:04,866 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:83, output treesize:5 [2018-12-02 06:07:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:04,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:07:04,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2018-12-02 06:07:04,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 06:07:04,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 06:07:04,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2018-12-02 06:07:04,894 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 28 states. [2018-12-02 06:07:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:06,266 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2018-12-02 06:07:06,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 06:07:06,267 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2018-12-02 06:07:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:06,267 INFO L225 Difference]: With dead ends: 125 [2018-12-02 06:07:06,267 INFO L226 Difference]: Without dead ends: 125 [2018-12-02 06:07:06,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=256, Invalid=1906, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 06:07:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-02 06:07:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2018-12-02 06:07:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-02 06:07:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2018-12-02 06:07:06,271 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 36 [2018-12-02 06:07:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:06,272 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2018-12-02 06:07:06,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 06:07:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2018-12-02 06:07:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 06:07:06,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:06,273 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:06,273 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:06,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:06,273 INFO L82 PathProgramCache]: Analyzing trace with hash -716486685, now seen corresponding path program 1 times [2018-12-02 06:07:06,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:06,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:06,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:06,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:06,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:06,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:07:06,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:07:06,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:06,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:07:06,583 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-02 06:07:06,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 06:07:06,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:06,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:06,632 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-02 06:07:06,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-12-02 06:07:06,670 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-02 06:07:06,671 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-02 06:07:06,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,681 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-02 06:07:06,682 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-02 06:07:06,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,691 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-12-02 06:07:06,718 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-02 06:07:06,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:06,720 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 27 [2018-12-02 06:07:06,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,736 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-02 06:07:06,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:06,738 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:07:06,739 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 36 [2018-12-02 06:07:06,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-12-02 06:07:06,786 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 0 case distinctions, treesize of input 83 treesize of output 77 [2018-12-02 06:07:06,788 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 16 treesize of output 15 [2018-12-02 06:07:06,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,812 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 45 [2018-12-02 06:07:06,814 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 16 treesize of output 15 [2018-12-02 06:07:06,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:06,832 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-02 06:07:06,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:93 [2018-12-02 06:07:07,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 148 [2018-12-02 06:07: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 137 treesize of output 128 [2018-12-02 06:07:07,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,291 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 133 treesize of output 103 [2018-12-02 06:07:07,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,348 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 128 treesize of output 98 [2018-12-02 06:07:07,348 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,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, 3 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-02 06:07:07,409 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:07:07,459 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 131 treesize of output 122 [2018-12-02 06:07:07,459 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,505 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-12-02 06:07:07,506 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-02 06:07:07,554 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:07:07,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,555 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 127 treesize of output 103 [2018-12-02 06:07:07,556 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,611 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 0 case distinctions, treesize of input 122 treesize of output 104 [2018-12-02 06:07:07,611 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:07:07,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-12-02 06:07:07,710 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 82 treesize of output 70 [2018-12-02 06:07:07,712 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 66 treesize of output 57 [2018-12-02 06:07:07,712 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,735 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 45 [2018-12-02 06:07:07,735 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,754 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 29 [2018-12-02 06:07:07,755 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,772 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 62 treesize of output 52 [2018-12-02 06:07:07,773 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-02 06:07:07,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,789 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 43 treesize of output 33 [2018-12-02 06:07:07,789 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,802 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 06:07:07,808 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 82 treesize of output 70 [2018-12-02 06:07:07,810 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 62 treesize of output 53 [2018-12-02 06:07:07,810 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,834 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:07:07,834 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 [2018-12-02 06:07:07,834 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,857 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,860 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 86 treesize of output 66 [2018-12-02 06:07:07,862 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-02 06:07:07,862 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,873 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 28 treesize of output 16 [2018-12-02 06:07:07,873 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,882 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 11 treesize of output 7 [2018-12-02 06:07:07,882 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,892 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 74 [2018-12-02 06:07:07,904 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 62 treesize of output 53 [2018-12-02 06:07:07,904 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,947 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:07:07,948 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 55 [2018-12-02 06:07:07,948 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,978 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 58 treesize of output 46 [2018-12-02 06:07:07,978 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:07,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:07,999 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 34 treesize of output 30 [2018-12-02 06:07:07,999 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:08,019 INFO L267 ElimStorePlain]: Start of recursive call 24: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:08,041 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-02 06:07:08,041 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 4 variables, input treesize:203, output treesize:23 [2018-12-02 06:07:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:08,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:07:08,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2018-12-02 06:07:08,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-02 06:07:08,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-02 06:07:08,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 06:07:08,122 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 35 states. [2018-12-02 06:07:08,938 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 111 [2018-12-02 06:07:09,358 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-12-02 06:07:10,124 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-12-02 06:07:10,534 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2018-12-02 06:07:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:11,005 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2018-12-02 06:07:11,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 06:07:11,005 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2018-12-02 06:07:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:11,006 INFO L225 Difference]: With dead ends: 136 [2018-12-02 06:07:11,006 INFO L226 Difference]: Without dead ends: 136 [2018-12-02 06:07:11,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=327, Invalid=2535, Unknown=0, NotChecked=0, Total=2862 [2018-12-02 06:07:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-02 06:07:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2018-12-02 06:07:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-02 06:07:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2018-12-02 06:07:11,010 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 36 [2018-12-02 06:07:11,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:11,010 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2018-12-02 06:07:11,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-02 06:07:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2018-12-02 06:07:11,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 06:07:11,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:11,011 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:11,011 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:11,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:11,012 INFO L82 PathProgramCache]: Analyzing trace with hash -736245799, now seen corresponding path program 1 times [2018-12-02 06:07:11,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:11,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:11,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:11,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:11,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 06:07:11,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:07:11,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 06:07:11,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 06:07:11,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 06:07:11,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 06:07:11,066 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand 10 states. [2018-12-02 06:07:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:11,163 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2018-12-02 06:07:11,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 06:07:11,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-12-02 06:07:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:11,164 INFO L225 Difference]: With dead ends: 122 [2018-12-02 06:07:11,164 INFO L226 Difference]: Without dead ends: 122 [2018-12-02 06:07:11,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-02 06:07:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-02 06:07:11,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2018-12-02 06:07:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-02 06:07:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2018-12-02 06:07:11,167 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 37 [2018-12-02 06:07:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:11,167 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2018-12-02 06:07:11,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 06:07:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2018-12-02 06:07:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 06:07:11,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:11,168 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:11,168 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:11,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:11,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1348783229, now seen corresponding path program 1 times [2018-12-02 06:07:11,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:11,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:11,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:11,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:11,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 06:07:11,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:07:11,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:07:11,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:07:11,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:07:11,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:07:11,190 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand 5 states. [2018-12-02 06:07:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:11,246 INFO L93 Difference]: Finished difference Result 130 states and 156 transitions. [2018-12-02 06:07:11,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:07:11,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-02 06:07:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:11,247 INFO L225 Difference]: With dead ends: 130 [2018-12-02 06:07:11,247 INFO L226 Difference]: Without dead ends: 130 [2018-12-02 06:07:11,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:07:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-02 06:07:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-12-02 06:07:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-02 06:07:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2018-12-02 06:07:11,252 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 38 [2018-12-02 06:07:11,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:11,252 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2018-12-02 06:07:11,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:07:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2018-12-02 06:07:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 06:07:11,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:11,253 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:11,253 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:11,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1132592664, now seen corresponding path program 1 times [2018-12-02 06:07:11,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:11,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:11,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:11,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 06:07:11,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:07:11,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 06:07:11,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 06:07:11,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 06:07:11,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-02 06:07:11,320 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand 11 states. [2018-12-02 06:07:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:11,527 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-12-02 06:07:11,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 06:07:11,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-12-02 06:07:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:11,527 INFO L225 Difference]: With dead ends: 132 [2018-12-02 06:07:11,528 INFO L226 Difference]: Without dead ends: 132 [2018-12-02 06:07:11,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-12-02 06:07:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-02 06:07:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2018-12-02 06:07:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-02 06:07:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2018-12-02 06:07:11,531 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 39 [2018-12-02 06:07:11,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:11,531 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2018-12-02 06:07:11,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 06:07:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2018-12-02 06:07:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 06:07:11,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:11,532 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:11,532 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:11,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:11,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1137392924, now seen corresponding path program 1 times [2018-12-02 06:07:11,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:11,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:11,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:11,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:11,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:11,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:07:11,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:07:11,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:11,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:07:11,766 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-02 06:07:11,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:11,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:11,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 06:07:12,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:12,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:12,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:12,732 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-02 06:07:12,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:12,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:12,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:8 [2018-12-02 06:07:12,800 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-02 06:07:12,801 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-02 06:07:12,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:12,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:12,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:12,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-12-02 06:07:12,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:12,815 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-02 06:07:12,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:12,818 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-02 06:07:12,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 06:07:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:12,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:07:12,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-12-02 06:07:12,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 06:07:12,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 06:07:12,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=727, Unknown=3, NotChecked=0, Total=812 [2018-12-02 06:07:12,851 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand 29 states. [2018-12-02 06:07:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:26,523 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2018-12-02 06:07:26,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 06:07:26,523 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2018-12-02 06:07:26,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:26,524 INFO L225 Difference]: With dead ends: 135 [2018-12-02 06:07:26,524 INFO L226 Difference]: Without dead ends: 135 [2018-12-02 06:07:26,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=1365, Unknown=3, NotChecked=0, Total=1560 [2018-12-02 06:07:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-02 06:07:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2018-12-02 06:07:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-02 06:07:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2018-12-02 06:07:26,526 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 39 [2018-12-02 06:07:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:26,526 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2018-12-02 06:07:26,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 06:07:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2018-12-02 06:07:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 06:07:26,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:26,527 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:26,527 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:26,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash 750634279, now seen corresponding path program 1 times [2018-12-02 06:07:26,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:26,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:26,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:26,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:26,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:26,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:07:26,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:07:26,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:26,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:07:26,749 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-02 06:07:26,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:26,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:26,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-12-02 06:07:27,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:27,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:27,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:27,676 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 16 treesize of output 13 [2018-12-02 06:07:27,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:27,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:27,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:12 [2018-12-02 06:07:27,777 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 22 treesize of output 34 [2018-12-02 06:07:27,779 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 23 treesize of output 22 [2018-12-02 06:07:27,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:27,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:27,797 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-02 06:07:27,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-12-02 06:07:27,827 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 25 treesize of output 27 [2018-12-02 06:07:27,828 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 23 treesize of output 16 [2018-12-02 06:07:27,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:27,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 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 06:07:27,839 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 06:07:27,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 16 treesize of output 9 [2018-12-02 06:07:27,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:27,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 06:07:27,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 06:07:27,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-12-02 06:07:27,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:27,884 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 12 treesize of output 21 [2018-12-02 06:07:27,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:27,889 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-02 06:07:27,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-12-02 06:07:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:27,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:07:27,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2018-12-02 06:07:27,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 06:07:27,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 06:07:27,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=889, Unknown=3, NotChecked=0, Total=992 [2018-12-02 06:07:27,927 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand 32 states. [2018-12-02 06:07:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:37,625 INFO L93 Difference]: Finished difference Result 133 states and 157 transitions. [2018-12-02 06:07:37,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 06:07:37,625 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-12-02 06:07:37,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:37,626 INFO L225 Difference]: With dead ends: 133 [2018-12-02 06:07:37,626 INFO L226 Difference]: Without dead ends: 133 [2018-12-02 06:07:37,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=276, Invalid=1883, Unknown=3, NotChecked=0, Total=2162 [2018-12-02 06:07:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-02 06:07:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2018-12-02 06:07:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-02 06:07:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2018-12-02 06:07:37,629 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 40 [2018-12-02 06:07:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:37,630 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2018-12-02 06:07:37,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 06:07:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2018-12-02 06:07:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 06:07:37,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:37,630 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:37,630 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:37,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash -564033654, now seen corresponding path program 2 times [2018-12-02 06:07:37,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:37,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:37,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:37,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:37,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:37,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:07:37,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:07:37,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 06:07:37,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 06:07:37,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 06:07:37,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:07:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:37,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:07:37,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 06:07:37,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 06:07:37,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 06:07:37,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:07:37,717 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand 7 states. [2018-12-02 06:07:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:37,741 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-12-02 06:07:37,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 06:07:37,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-12-02 06:07:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:37,742 INFO L225 Difference]: With dead ends: 84 [2018-12-02 06:07:37,742 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 06:07:37,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:07:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 06:07:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-02 06:07:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 06:07:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-12-02 06:07:37,744 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 40 [2018-12-02 06:07:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:37,744 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-12-02 06:07:37,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 06:07:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-12-02 06:07:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 06:07:37,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:37,745 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:37,745 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:37,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:37,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1427946481, now seen corresponding path program 1 times [2018-12-02 06:07:37,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:37,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:37,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:37,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:07:37,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 06:07:37,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:07:37,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 06:07:37,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:07:37,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:07:37,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:07:37,769 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 5 states. [2018-12-02 06:07:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:37,815 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-12-02 06:07:37,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:07:37,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-02 06:07:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:37,816 INFO L225 Difference]: With dead ends: 71 [2018-12-02 06:07:37,816 INFO L226 Difference]: Without dead ends: 71 [2018-12-02 06:07:37,816 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-02 06:07:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-02 06:07:37,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-02 06:07:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-02 06:07:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-12-02 06:07:37,818 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 44 [2018-12-02 06:07:37,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:37,819 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-12-02 06:07:37,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:07:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-12-02 06:07:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 06:07:37,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:37,819 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:07:37,819 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:37,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:37,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2132968081, now seen corresponding path program 1 times [2018-12-02 06:07:37,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:37,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:37,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:37,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:37,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 06:07:37,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:07:37,844 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:07:37,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:37,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:07:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 06:07:37,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:07:37,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-02 06:07:37,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 06:07:37,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 06:07:37,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 06:07:37,890 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 5 states. [2018-12-02 06:07:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:37,914 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-02 06:07:37,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 06:07:37,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 06:07:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:37,915 INFO L225 Difference]: With dead ends: 73 [2018-12-02 06:07:37,915 INFO L226 Difference]: Without dead ends: 73 [2018-12-02 06:07:37,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 06:07:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-02 06:07:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-02 06:07:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 06:07:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-12-02 06:07:37,916 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 46 [2018-12-02 06:07:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:37,916 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-12-02 06:07:37,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 06:07:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-12-02 06:07:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 06:07:37,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:37,917 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] [2018-12-02 06:07:37,917 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:37,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:37,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1701092898, now seen corresponding path program 1 times [2018-12-02 06:07:37,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:37,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:37,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:37,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:37,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:38,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:07:38,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:07:38,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:38,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:07:38,390 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-02 06:07:38,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-12-02 06:07:38,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:38,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:38,431 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-02 06:07:38,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-12-02 06:07:38,468 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-02 06:07:38,469 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 10 treesize of output 9 [2018-12-02 06:07:38,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-02 06:07:38,498 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 19 treesize of output 14 [2018-12-02 06:07:38,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:38,500 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 14 treesize of output 23 [2018-12-02 06:07:38,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-02 06:07:38,535 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-12-02 06:07:38,536 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 14 treesize of output 13 [2018-12-02 06:07:38,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,544 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-02 06:07:38,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-12-02 06:07:38,969 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 21 [2018-12-02 06:07:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-12-02 06:07:38,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:38,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2018-12-02 06:07:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:39,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:07:39,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 47 [2018-12-02 06:07:39,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-02 06:07:39,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-02 06:07:39,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2029, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 06:07:39,249 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 47 states. [2018-12-02 06:07:40,229 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-12-02 06:07:40,601 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-12-02 06:07:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:42,546 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-12-02 06:07:42,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-02 06:07:42,547 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-02 06:07:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:42,547 INFO L225 Difference]: With dead ends: 84 [2018-12-02 06:07:42,547 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 06:07:42,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=479, Invalid=4777, Unknown=0, NotChecked=0, Total=5256 [2018-12-02 06:07:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 06:07:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2018-12-02 06:07:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 06:07:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-12-02 06:07:42,549 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 47 [2018-12-02 06:07:42,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:42,549 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-12-02 06:07:42,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-02 06:07:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-12-02 06:07:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 06:07:42,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:42,550 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] [2018-12-02 06:07:42,550 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:42,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:42,550 INFO L82 PathProgramCache]: Analyzing trace with hash -163583187, now seen corresponding path program 1 times [2018-12-02 06:07:42,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:42,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:42,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:42,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:42,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:43,040 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-02 06:07:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:43,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:07:43,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:07:43,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:43,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:07:43,625 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-02 06:07:43,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:43,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:43,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 06:07:43,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:43,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:43,631 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-02 06:07:43,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:43,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:43,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 06:07:43,658 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-02 06:07:43,659 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-02 06:07:43,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:43,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:43,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:43,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-12-02 06:07:43,686 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-02 06:07:43,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:43,691 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 27 [2018-12-02 06:07:43,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:43,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:43,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:43,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-12-02 06:07:43,731 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 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-02 06:07:43,732 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 16 treesize of output 15 [2018-12-02 06:07:43,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:43,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:43,747 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-02 06:07:43,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2018-12-02 06:07:45,225 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-02 06:07:45,728 WARN L180 SmtUtils]: Spent 464.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-02 06:07:45,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:45,739 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 16 treesize of output 51 [2018-12-02 06:07:45,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 06:07:45,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 06:07:45,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:133 [2018-12-02 06:07:46,730 WARN L180 SmtUtils]: Spent 926.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-02 06:07:46,945 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 53 [2018-12-02 06:07:46,947 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 209 treesize of output 189 [2018-12-02 06:07:46,950 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 174 treesize of output 154 [2018-12-02 06:07:46,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:46,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:46,966 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 221 treesize of output 199 [2018-12-02 06:07:46,968 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 189 treesize of output 167 [2018-12-02 06:07:46,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:46,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:46,980 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 221 treesize of output 199 [2018-12-02 06:07:46,982 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 190 treesize of output 168 [2018-12-02 06:07:46,983 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:46,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:47,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,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 5 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 119 [2018-12-02 06:07:47,077 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 2 case distinctions, treesize of input 136 treesize of output 155 [2018-12-02 06:07:47,077 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-02 06:07:47,179 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 2 case distinctions, treesize of input 74 treesize of output 96 [2018-12-02 06:07:47,179 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 06:07:47,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,294 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 87 [2018-12-02 06:07:47,311 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 84 [2018-12-02 06:07:47,312 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 06:07:47,334 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 06:07:47,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,339 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 83 [2018-12-02 06:07:47,342 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 73 treesize of output 66 [2018-12-02 06:07:47,343 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-02 06:07:47,352 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:07:47,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,457 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 0 case distinctions, treesize of input 105 treesize of output 106 [2018-12-02 06:07:47,459 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 78 [2018-12-02 06:07:47,460 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:07:47,470 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:07:47,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,478 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 0 case distinctions, treesize of input 121 treesize of output 110 [2018-12-02 06:07:47,480 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 93 [2018-12-02 06:07:47,481 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:07:47,491 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:07:47,569 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,588 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 129 [2018-12-02 06:07:47,591 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:07:47,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 110 [2018-12-02 06:07:47,653 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:07:47,693 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-02 06:07:47,757 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 06:07:47,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:47,831 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 80 [2018-12-02 06:07:47,832 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 06:07:47,902 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-02 06:07:48,030 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 10 xjuncts. [2018-12-02 06:07:48,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 82 [2018-12-02 06:07:48,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 76 [2018-12-02 06:07:48,046 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 06:07:48,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:48,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:48,072 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 69 [2018-12-02 06:07:48,074 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 32 treesize of output 33 [2018-12-02 06:07:48,074 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:48,081 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:48,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:48,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:48,086 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 79 [2018-12-02 06:07:48,103 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 3 case distinctions, treesize of input 92 treesize of output 84 [2018-12-02 06:07:48,104 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 3 xjuncts. [2018-12-02 06:07:48,124 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 06:07:48,142 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-02 06:07:48,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:48,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:48,153 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 116 [2018-12-02 06:07:48,161 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 2 case distinctions, treesize of input 32 treesize of output 51 [2018-12-02 06:07:48,161 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-12-02 06:07:48,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:48,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:48,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:48,184 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 0 case distinctions, treesize of input 99 treesize of output 100 [2018-12-02 06:07:48,186 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 78 [2018-12-02 06:07:48,187 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:07:48,198 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:07:48,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:48,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:48,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:48,207 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 0 case distinctions, treesize of input 115 treesize of output 104 [2018-12-02 06:07:48,209 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 93 [2018-12-02 06:07:48,209 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-02 06:07:48,219 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 06:07:48,235 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 06:07:48,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 29 dim-0 vars, and 15 xjuncts. [2018-12-02 06:07:48,441 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 8 variables, input treesize:539, output treesize:1212 [2018-12-02 06:07:48,798 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 71 [2018-12-02 06:07:49,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:49,008 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 67 treesize of output 54 [2018-12-02 06:07:49,011 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 26 treesize of output 14 [2018-12-02 06:07:49,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:49,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:49,018 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 20 treesize of output 12 [2018-12-02 06:07:49,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:49,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:49,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:49,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:49,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, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 63 [2018-12-02 06:07:49,044 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-02 06:07:49,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:49,054 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 24 treesize of output 10 [2018-12-02 06:07:49,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:49,059 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-02 06:07:49,059 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:49,063 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:49,079 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 56 treesize of output 41 [2018-12-02 06:07:49,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:49,081 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 26 treesize of output 20 [2018-12-02 06:07:49,081 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:49,089 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-02 06:07:49,089 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:49,092 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:49,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-02 06:07:49,103 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:190, output treesize:43 [2018-12-02 06:07:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:49,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:07:49,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 43 [2018-12-02 06:07:49,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-02 06:07:49,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-02 06:07:49,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1770, Unknown=0, NotChecked=0, Total=1892 [2018-12-02 06:07:49,188 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 44 states. [2018-12-02 06:07:50,274 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2018-12-02 06:07:50,542 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2018-12-02 06:07:51,114 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-12-02 06:07:51,347 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-12-02 06:07:52,013 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 92 [2018-12-02 06:07:52,304 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 88 [2018-12-02 06:07:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:52,967 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-12-02 06:07:52,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-02 06:07:52,968 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 48 [2018-12-02 06:07:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:52,968 INFO L225 Difference]: With dead ends: 92 [2018-12-02 06:07:52,969 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 06:07:52,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=308, Invalid=3598, Unknown=0, NotChecked=0, Total=3906 [2018-12-02 06:07:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 06:07:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-12-02 06:07:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 06:07:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-12-02 06:07:52,971 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 48 [2018-12-02 06:07:52,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:52,971 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-12-02 06:07:52,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-02 06:07:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-12-02 06:07:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 06:07:52,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:52,972 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] [2018-12-02 06:07:52,972 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:52,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:52,972 INFO L82 PathProgramCache]: Analyzing trace with hash -163583186, now seen corresponding path program 1 times [2018-12-02 06:07:52,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:52,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:52,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:52,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:52,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:53,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:07:53,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:07:53,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:53,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:07:53,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 6 treesize of output 5 [2018-12-02 06:07:53,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:53,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:53,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 06:07:53,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:53,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:53,460 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-02 06:07:53,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:53,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:53,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-02 06:07:53,481 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-02 06:07:53,482 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-02 06:07:53,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:53,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:53,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:53,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-12-02 06:07:53,510 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-02 06:07:53,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:53,512 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:07:53,513 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 36 [2018-12-02 06:07:53,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:53,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:53,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:53,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-12-02 06:07:53,547 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 30 treesize of output 31 [2018-12-02 06:07:53,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-02 06:07:53,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:53,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:53,556 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-02 06:07:53,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-12-02 06:07:54,072 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-02 06:07:54,075 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-02 06:07:54,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:54,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:54,092 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 22 [2018-12-02 06:07:54,095 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 22 treesize of output 21 [2018-12-02 06:07:54,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:54,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:54,107 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-02 06:07:54,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:47 [2018-12-02 06:07:54,215 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 89 treesize of output 79 [2018-12-02 06:07:54,218 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 79 treesize of output 69 [2018-12-02 06:07:54,219 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-02 06:07:54,235 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-02 06:07:54,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 76 [2018-12-02 06:07:54,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:54,281 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 64 treesize of output 50 [2018-12-02 06:07:54,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:54,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:54,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:54,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:54,331 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 69 [2018-12-02 06:07:54,331 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:54,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:54,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:54,367 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:54,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:54,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:54,374 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 66 [2018-12-02 06:07:54,374 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:54,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:54,401 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-02 06:07:54,401 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:103, output treesize:26 [2018-12-02 06:07:54,506 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 19 [2018-12-02 06:07:54,507 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 11 [2018-12-02 06:07:54,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:54,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:54,512 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-02 06:07:54,514 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-02 06:07:54,514 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:54,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:54,518 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-02 06:07:54,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-12-02 06:07:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:54,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:07:54,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2018-12-02 06:07:54,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-02 06:07:54,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-02 06:07:54,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1699, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 06:07:54,565 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 43 states. [2018-12-02 06:07:56,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:07:56,437 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2018-12-02 06:07:56,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-02 06:07:56,437 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 48 [2018-12-02 06:07:56,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:07:56,438 INFO L225 Difference]: With dead ends: 102 [2018-12-02 06:07:56,438 INFO L226 Difference]: Without dead ends: 102 [2018-12-02 06:07:56,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=340, Invalid=3950, Unknown=0, NotChecked=0, Total=4290 [2018-12-02 06:07:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-02 06:07:56,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2018-12-02 06:07:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 06:07:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-12-02 06:07:56,441 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 48 [2018-12-02 06:07:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:07:56,442 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-12-02 06:07:56,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-02 06:07:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-12-02 06:07:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 06:07:56,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:07:56,442 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 06:07:56,443 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:07:56,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:07:56,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1481141252, now seen corresponding path program 1 times [2018-12-02 06:07:56,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:07:56,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:07:56,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:56,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:56,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:07:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:07:57,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:07:57,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:07:57,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:07:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:07:57,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:07:57,438 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-02 06:07:57,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 06:07:57,538 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-02 06:07:57,539 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-02 06:07:57,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,548 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-02 06:07:57,549 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-02 06:07:57,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-12-02 06:07:57,598 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-02 06:07:57,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:57,600 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 27 [2018-12-02 06:07:57,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,615 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-02 06:07:57,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:57,617 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 27 [2018-12-02 06:07:57,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-12-02 06:07:57,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:57,770 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 35 [2018-12-02 06:07:57,771 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 12 treesize of output 1 [2018-12-02 06:07:57,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:57,792 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 35 [2018-12-02 06:07:57,793 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 12 treesize of output 1 [2018-12-02 06:07:57,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:62 [2018-12-02 06:07:57,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:57,871 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 32 treesize of output 33 [2018-12-02 06:07:57,873 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-02 06:07:57,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:57,897 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 32 treesize of output 45 [2018-12-02 06:07:57,899 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-02 06:07:57,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:57,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:88, output treesize:92 [2018-12-02 06:07:57,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:57,986 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 71 treesize of output 66 [2018-12-02 06:07:57,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:57,989 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 44 treesize of output 57 [2018-12-02 06:07:57,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:58,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:58,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:58,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-12-02 06:07:58,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:58,029 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:07:58,030 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 36 [2018-12-02 06:07:58,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:58,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:58,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:58,064 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:118, output treesize:110 [2018-12-02 06:07:58,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:58,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:58,146 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 144 [2018-12-02 06:07:58,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:58,151 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 42 treesize of output 53 [2018-12-02 06:07:58,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:58,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:58,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:58,187 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:07:58,188 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 74 treesize of output 66 [2018-12-02 06:07:58,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:58,190 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 38 treesize of output 42 [2018-12-02 06:07:58,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:58,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:07:58,212 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-02 06:07:58,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:175, output treesize:125 [2018-12-02 06:07:58,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:58,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:58,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:58,479 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 22 treesize of output 25 [2018-12-02 06:07:58,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:07:58,501 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-02 06:07:58,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:133, output treesize:127 [2018-12-02 06:07:59,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:59,656 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 458 treesize of output 332 [2018-12-02 06:07:59,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:59,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:07:59,678 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:07:59,733 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 193 [2018-12-02 06:07:59,735 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-02 06:08:00,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:00,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:00,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:00,074 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 376 treesize of output 319 [2018-12-02 06:08:00,081 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 324 [2018-12-02 06:08:00,083 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-02 06:08:00,209 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-02 06:08:00,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:00,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:00,255 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 0 case distinctions, treesize of input 378 treesize of output 323 [2018-12-02 06:08:00,264 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 351 treesize of output 304 [2018-12-02 06:08:00,265 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-02 06:08:00,356 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-02 06:08:00,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:00,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:00,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:00,399 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 328 [2018-12-02 06:08:00,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 341 [2018-12-02 06:08:00,408 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-02 06:08:00,441 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-02 06:08:00,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 06:08:01,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,401 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:01,402 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 304 treesize of output 255 [2018-12-02 06:08:01,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,406 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:01,406 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 60 treesize of output 79 [2018-12-02 06:08:01,407 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:01,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,435 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:01,436 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 207 treesize of output 213 [2018-12-02 06:08:01,439 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 180 treesize of output 151 [2018-12-02 06:08:01,439 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:01,456 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:01,470 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:01,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,483 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:01,483 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 306 treesize of output 257 [2018-12-02 06:08:01,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,488 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:01,488 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 60 treesize of output 79 [2018-12-02 06:08:01,488 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:01,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,522 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:01,522 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 216 treesize of output 220 [2018-12-02 06:08:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 156 [2018-12-02 06:08:01,525 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:01,545 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:01,560 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:01,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,570 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:01,571 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 323 treesize of output 274 [2018-12-02 06:08:01,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,579 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,579 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:01,580 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 60 treesize of output 87 [2018-12-02 06:08:01,580 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:01,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:01,612 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:01,614 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 226 treesize of output 230 [2018-12-02 06:08:01,617 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 197 treesize of output 166 [2018-12-02 06:08:01,617 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:01,636 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:01,651 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:01,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-12-02 06:08:01,710 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 3 variables, input treesize:481, output treesize:499 [2018-12-02 06:08:03,754 WARN L180 SmtUtils]: Spent 930.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-02 06:08:03,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:03,766 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 173 [2018-12-02 06:08:03,768 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:03,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:03,770 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 47 treesize of output 44 [2018-12-02 06:08:03,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:03,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:03,792 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:03,792 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 32 treesize of output 33 [2018-12-02 06:08:03,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:03,809 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-12-02 06:08:03,809 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-02 06:08:03,823 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-02 06:08:03,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:03,866 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 194 treesize of output 176 [2018-12-02 06:08:03,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:03,869 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:03,870 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 28 treesize of output 25 [2018-12-02 06:08:03,870 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:03,891 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 13 [2018-12-02 06:08:03,891 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:03,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:03,907 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:03,907 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 27 [2018-12-02 06:08:03,907 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:03,919 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:03,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:03,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:03,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-12-02 06:08:03,952 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 8 [2018-12-02 06:08:03,952 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:03,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:03,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:03,968 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 1 case distinctions, treesize of input 32 treesize of output 39 [2018-12-02 06:08:03,969 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-02 06:08:03,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:03,980 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 22 treesize of output 12 [2018-12-02 06:08:03,980 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:03,985 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:04,008 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 96 treesize of output 80 [2018-12-02 06:08:04,009 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 7 [2018-12-02 06:08:04,009 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:04,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:04,022 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:04,023 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 30 treesize of output 19 [2018-12-02 06:08:04,023 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:04,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:04,035 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 22 treesize of output 12 [2018-12-02 06:08:04,035 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:04,041 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:04,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:04,053 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 11 variables, input treesize:385, output treesize:7 [2018-12-02 06:08:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:04,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:08:04,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 56 [2018-12-02 06:08:04,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-02 06:08:04,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-02 06:08:04,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2914, Unknown=1, NotChecked=0, Total=3080 [2018-12-02 06:08:04,138 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 56 states. [2018-12-02 06:08:06,345 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2018-12-02 06:08:07,288 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 113 [2018-12-02 06:08:08,097 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2018-12-02 06:08:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:08,551 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-12-02 06:08:08,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-02 06:08:08,551 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 51 [2018-12-02 06:08:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:08,552 INFO L225 Difference]: With dead ends: 92 [2018-12-02 06:08:08,552 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 06:08:08,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=439, Invalid=6532, Unknown=1, NotChecked=0, Total=6972 [2018-12-02 06:08:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 06:08:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-12-02 06:08:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-02 06:08:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-12-02 06:08:08,555 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 51 [2018-12-02 06:08:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:08,555 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-12-02 06:08:08,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-02 06:08:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-12-02 06:08:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 06:08:08,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:08,555 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 06:08:08,556 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:08:08,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:08,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1329256457, now seen corresponding path program 1 times [2018-12-02 06:08:08,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:08,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:08,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:08,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:08,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:08,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:08:08,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:08:08,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:08,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:08:08,927 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-02 06:08:08,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:08,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:08,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 06:08:08,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:08,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:08,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, 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-02 06:08:08,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:08,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:08,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-02 06:08:08,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-02 06:08:08,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-02 06:08:08,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:08,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:08,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:08,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-12-02 06:08:09,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 23 treesize of output 18 [2018-12-02 06:08:09,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:09,012 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:09,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 18 treesize of output 36 [2018-12-02 06:08:09,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-02 06:08:09,048 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 30 treesize of output 31 [2018-12-02 06:08:09,049 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-02 06:08:09,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,059 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-02 06:08:09,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-12-02 06:08:09,466 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 22 [2018-12-02 06:08:09,467 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 22 treesize of output 21 [2018-12-02 06:08:09,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-02 06:08:09,497 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 52 treesize of output 44 [2018-12-02 06:08:09,498 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 44 treesize of output 36 [2018-12-02 06:08:09,499 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-02 06:08:09,503 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-02 06:08:09,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2018-12-02 06:08:09,520 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 41 treesize of output 37 [2018-12-02 06:08:09,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:09,547 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:09,547 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 37 [2018-12-02 06:08:09,548 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:09,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:09,571 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 06:08:09,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:09,572 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-02 06:08:09,573 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:09,600 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 18 treesize of output 15 [2018-12-02 06:08:09,601 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,614 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-02 06:08:09,614 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:69, output treesize:11 [2018-12-02 06:08:09,680 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-02 06:08:09,681 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-02 06:08:09,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:09,682 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-02 06:08:09,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-02 06:08:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:09,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:08:09,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 39 [2018-12-02 06:08:09,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-02 06:08:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-02 06:08:09,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 06:08:09,703 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 40 states. [2018-12-02 06:08:10,480 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2018-12-02 06:08:10,780 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2018-12-02 06:08:11,030 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2018-12-02 06:08:12,376 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-12-02 06:08:12,635 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-02 06:08:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:12,827 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-12-02 06:08:12,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-02 06:08:12,828 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 52 [2018-12-02 06:08:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:12,829 INFO L225 Difference]: With dead ends: 116 [2018-12-02 06:08:12,830 INFO L226 Difference]: Without dead ends: 116 [2018-12-02 06:08:12,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=483, Invalid=4487, Unknown=0, NotChecked=0, Total=4970 [2018-12-02 06:08:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-02 06:08:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2018-12-02 06:08:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-02 06:08:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-12-02 06:08:12,839 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 52 [2018-12-02 06:08:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:12,839 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-12-02 06:08:12,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-02 06:08:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-12-02 06:08:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 06:08:12,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:12,841 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:08:12,841 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:08:12,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:12,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1810166342, now seen corresponding path program 1 times [2018-12-02 06:08:12,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:12,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:12,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:12,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:12,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:13,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:08:13,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:08:13,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:13,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:08:13,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-02 06:08:13,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:13,550 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-02 06:08:13,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:13,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:13,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 06:08:13,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:13,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:13,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:13,669 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-02 06:08:13,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:13,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:13,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 06:08:13,681 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 23 treesize of output 34 [2018-12-02 06:08:13,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:13,688 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:13,695 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-02 06:08:13,695 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2018-12-02 06:08:13,830 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-02 06:08:13,832 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-02 06:08:13,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:13,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:13,843 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-02 06:08:13,845 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-02 06:08:13,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:13,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:13,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 06:08:13,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:49, output treesize:35 [2018-12-02 06:08:13,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:13,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:13,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:13,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:13,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:13,923 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 78 [2018-12-02 06:08:13,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2018-12-02 06:08:13,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 06:08:13,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:45 [2018-12-02 06:08:14,426 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 29 treesize of output 25 [2018-12-02 06:08:14,431 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-02 06:08:14,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:14,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:14,495 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 24 [2018-12-02 06:08:14,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, 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-02 06:08:14,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:14,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:14,564 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 17 treesize of output 15 [2018-12-02 06:08:14,568 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-02 06:08:14,569 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:14,578 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:14,617 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 18 treesize of output 16 [2018-12-02 06:08:14,621 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-02 06:08:14,621 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:14,630 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:14,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 06:08:14,652 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:58, output treesize:22 [2018-12-02 06:08:14,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:14,757 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-02 06:08:14,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:14,763 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-02 06:08:14,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-02 06:08:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:14,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:08:14,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18] total 40 [2018-12-02 06:08:14,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-02 06:08:14,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-02 06:08:14,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1516, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 06:08:14,852 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 41 states. [2018-12-02 06:08:21,219 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2018-12-02 06:08:21,631 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 69 [2018-12-02 06:08:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:24,503 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-12-02 06:08:24,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 06:08:24,503 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-12-02 06:08:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:24,504 INFO L225 Difference]: With dead ends: 129 [2018-12-02 06:08:24,504 INFO L226 Difference]: Without dead ends: 129 [2018-12-02 06:08:24,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=604, Invalid=4083, Unknown=5, NotChecked=0, Total=4692 [2018-12-02 06:08:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-02 06:08:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2018-12-02 06:08:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-02 06:08:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2018-12-02 06:08:24,507 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 54 [2018-12-02 06:08:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:24,507 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2018-12-02 06:08:24,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-02 06:08:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2018-12-02 06:08:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 06:08:24,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:24,507 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 06:08:24,507 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:08:24,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:24,508 INFO L82 PathProgramCache]: Analyzing trace with hash 425878579, now seen corresponding path program 1 times [2018-12-02 06:08:24,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:24,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:24,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:24,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:08:26,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 06:08:26,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/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-02 06:08:26,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:26,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:08:26,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:26,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:26,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:23 [2018-12-02 06:08:26,290 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-02 06:08:26,291 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-02 06:08:26,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:26,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:26,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:26,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-12-02 06:08:26,332 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-02 06:08:26,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:26,334 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 27 [2018-12-02 06:08:26,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:26,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:26,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:26,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-12-02 06:08:26,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:26,389 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 0 case distinctions, treesize of input 75 treesize of output 79 [2018-12-02 06:08:26,390 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 16 treesize of output 15 [2018-12-02 06:08:26,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:26,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:26,405 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-02 06:08:26,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:65 [2018-12-02 06:08:27,190 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 165 treesize of output 162 [2018-12-02 06:08:27,192 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-02 06:08:27,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:27,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:27,232 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 179 treesize of output 176 [2018-12-02 06:08:27,234 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-02 06:08:27,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:27,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 06:08:27,269 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-02 06:08:27,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:345, output treesize:351 [2018-12-02 06:08:27,529 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2018-12-02 06:08:27,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:27,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:27,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:27,545 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 211 [2018-12-02 06:08:27,556 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 2 case distinctions, treesize of input 40 treesize of output 67 [2018-12-02 06:08:27,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 06:08:27,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:27,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:27,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:27,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:27,601 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 189 [2018-12-02 06:08:27,603 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 180 [2018-12-02 06:08:27,603 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-02 06:08:27,618 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-02 06:08:27,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:27,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:27,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:27,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:27,628 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 189 [2018-12-02 06:08:27,631 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 161 [2018-12-02 06:08:27,631 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-02 06:08:27,646 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-02 06:08:27,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 06:08:27,773 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 156 treesize of output 140 [2018-12-02 06:08:27,775 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 132 treesize of output 116 [2018-12-02 06:08:27,775 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-02 06:08:27,790 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-02 06:08:27,791 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 148 treesize of output 134 [2018-12-02 06:08:27,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 101 [2018-12-02 06:08:27,794 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-02 06:08:27,808 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-02 06:08:27,895 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 251 treesize of output 231 [2018-12-02 06:08:27,897 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 215 treesize of output 195 [2018-12-02 06:08:27,898 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-02 06:08:27,920 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-02 06:08:28,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,043 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 173 [2018-12-02 06:08:28,052 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 2 case distinctions, treesize of input 36 treesize of output 59 [2018-12-02 06:08:28,053 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-02 06:08:28,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,093 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 0 case distinctions, treesize of input 150 treesize of output 143 [2018-12-02 06:08:28,095 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 130 [2018-12-02 06:08:28,096 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-02 06:08:28,110 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-02 06:08:28,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,121 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 0 case distinctions, treesize of input 138 treesize of output 143 [2018-12-02 06:08:28,123 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 115 [2018-12-02 06:08:28,124 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-02 06:08:28,140 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-02 06:08:28,177 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 06:08:28,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-12-02 06:08:28,301 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:611, output treesize:463 [2018-12-02 06:08:28,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 06:08:28,676 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 109 [2018-12-02 06:08:28,678 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 31 treesize of output 23 [2018-12-02 06:08:28,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:28,694 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-02 06:08:28,694 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:28,703 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 66 treesize of output 47 [2018-12-02 06:08:28,703 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-02 06:08:28,711 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-02 06:08:28,720 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 7 treesize of output 5 [2018-12-02 06:08:28,721 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 06:08:28,729 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-02 06:08:28,729 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:120, output treesize:44 [2018-12-02 06:08:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 06:08:37,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 06:08:37,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 53 [2018-12-02 06:08:37,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-02 06:08:37,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-02 06:08:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2693, Unknown=7, NotChecked=0, Total=2862 [2018-12-02 06:08:37,514 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand 54 states. [2018-12-02 06:08:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:52,594 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2018-12-02 06:08:52,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-02 06:08:52,594 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 61 [2018-12-02 06:08:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:52,595 INFO L225 Difference]: With dead ends: 127 [2018-12-02 06:08:52,595 INFO L226 Difference]: Without dead ends: 124 [2018-12-02 06:08:52,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=333, Invalid=4916, Unknown=7, NotChecked=0, Total=5256 [2018-12-02 06:08:52,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-02 06:08:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-12-02 06:08:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-02 06:08:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2018-12-02 06:08:52,597 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 61 [2018-12-02 06:08:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:52,598 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2018-12-02 06:08:52,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-02 06:08:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2018-12-02 06:08:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 06:08:52,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 06:08:52,598 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 06:08:52,598 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_createErr1REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, dll_remove_firstErr7REQUIRES_VIOLATION, dll_remove_firstErr2REQUIRES_VIOLATION, dll_remove_firstErr1REQUIRES_VIOLATION, dll_remove_firstErr9ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr6REQUIRES_VIOLATION, dll_remove_firstErr11REQUIRES_VIOLATION, dll_remove_firstErr5REQUIRES_VIOLATION, dll_remove_firstErr0REQUIRES_VIOLATION, dll_remove_firstErr8ASSERT_VIOLATIONMEMORY_FREE, dll_remove_firstErr10REQUIRES_VIOLATION, dll_remove_firstErr4REQUIRES_VIOLATION, dll_remove_firstErr3REQUIRES_VIOLATION]=== [2018-12-02 06:08:52,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:08:52,598 INFO L82 PathProgramCache]: Analyzing trace with hash 320925888, now seen corresponding path program 1 times [2018-12-02 06:08:52,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:08:52,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:08:52,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:52,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:08:52,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:08:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:08:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 06:08:52,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:08:52,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 06:08:52,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 06:08:52,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:08:52,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:08:52,621 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand 6 states. [2018-12-02 06:08:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:08:52,639 INFO L93 Difference]: Finished difference Result 58 states and 57 transitions. [2018-12-02 06:08:52,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:08:52,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-02 06:08:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 06:08:52,639 INFO L225 Difference]: With dead ends: 58 [2018-12-02 06:08:52,639 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 06:08:52,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 06:08:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 06:08:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 06:08:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 06:08:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 06:08:52,640 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-12-02 06:08:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 06:08:52,640 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:08:52,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 06:08:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 06:08:52,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 06:08:52,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:08:52 BoogieIcfgContainer [2018-12-02 06:08:52,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 06:08:52,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:08:52,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:08:52,644 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:08:52,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:06:54" (3/4) ... [2018-12-02 06:08:52,647 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 06:08:52,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 06:08:52,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-02 06:08:52,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2018-12-02 06:08:52,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-12-02 06:08:52,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-12-02 06:08:52,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 06:08:52,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-02 06:08:52,652 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_remove_first [2018-12-02 06:08:52,655 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-02 06:08:52,656 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 06:08:52,656 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 06:08:52,682 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_58978d5f-c5a6-43f1-873e-c60a089439d7/bin-2019/uautomizer/witness.graphml [2018-12-02 06:08:52,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:08:52,682 INFO L168 Benchmark]: Toolchain (without parser) took 119191.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 956.0 MB in the beginning and 804.9 MB in the end (delta: 151.1 MB). Peak memory consumption was 266.4 MB. Max. memory is 11.5 GB. [2018-12-02 06:08:52,682 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:08:52,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -109.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-02 06:08:52,683 INFO L168 Benchmark]: Boogie Preprocessor took 30.05 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:08:52,683 INFO L168 Benchmark]: RCFGBuilder took 282.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2018-12-02 06:08:52,683 INFO L168 Benchmark]: TraceAbstraction took 118569.40 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Free memory was 1.0 GB in the beginning and 811.5 MB in the end (delta: 199.7 MB). Peak memory consumption was 233.3 MB. Max. memory is 11.5 GB. [2018-12-02 06:08:52,683 INFO L168 Benchmark]: Witness Printer took 38.21 ms. Allocated memory is still 1.1 GB. Free memory was 811.5 MB in the beginning and 804.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-12-02 06:08:52,684 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -109.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.05 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 282.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 118569.40 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Free memory was 1.0 GB in the beginning and 811.5 MB in the end (delta: 199.7 MB). Peak memory consumption was 233.3 MB. Max. memory is 11.5 GB. * Witness Printer took 38.21 ms. Allocated memory is still 1.1 GB. Free memory was 811.5 MB in the beginning and 804.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 91 locations, 29 error locations. SAFE Result, 118.5s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 77.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1253 SDtfs, 2725 SDslu, 7750 SDs, 0 SdLazy, 16743 SolverSat, 648 SolverUnsat, 36 SolverUnknown, 0 SolverNotchecked, 48.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1444 GetRequests, 579 SyntacticMatches, 43 SemanticMatches, 822 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 57.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 32 MinimizatonAttempts, 262 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 39.6s InterpolantComputationTime, 1894 NumberOfCodeBlocks, 1894 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1843 ConstructedInterpolants, 203 QuantifiedInterpolants, 1612681 SizeOfPredicates, 259 NumberOfNonLiveVariables, 4343 ConjunctsInSsa, 833 ConjunctsInUnsatCore, 51 InterpolantComputations, 13 PerfectInterpolantSequences, 180/554 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...